5 results
COMPUTABLE REDUCIBILITY OF EQUIVALENCE RELATIONS AND AN EFFECTIVE JUMP OPERATOR
- Part of
-
- Journal:
- The Journal of Symbolic Logic / Volume 88 / Issue 2 / June 2023
- Published online by Cambridge University Press:
- 13 June 2022, pp. 540-561
- Print publication:
- June 2023
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
G. A. Elliott, I. Farah, V. I. Paulsen, C. Rosendal, A. S. Toms, and A. Törnquist. The isomorphism relation for separable C*-algebras. Mathematics Research Letters, vol. 20 (2013), no. 6, pp. 1071–1080. - Marcin Sabok. Completeness of the isomorphism problem for separable C*-algebras. Inventiones Mathematicae, to appear, published online at link.springer.com/journal/222.
-
- Journal:
- Bulletin of Symbolic Logic / Volume 21 / Issue 4 / December 2015
- Published online by Cambridge University Press:
- 15 January 2016, pp. 427-430
- Print publication:
- December 2015
-
- Article
- Export citation
Infinite time Turing machines and an application to the hierarchy of equivalence relations on the reals
-
-
- Book:
- Effective Mathematics of the Uncountable
- Published online:
- 05 December 2013
- Print publication:
- 31 October 2013, pp 33-49
-
- Chapter
- Export citation
Su Gao. Invariant descriptive set theory. Pure and applied mathematics. Chapman & Hall/CRC, Boca Raton, 2009, xiv + 392 pp.
-
- Journal:
- Bulletin of Symbolic Logic / Volume 17 / Issue 2 / June 2011
- Published online by Cambridge University Press:
- 15 January 2014, pp. 265-267
- Print publication:
- June 2011
-
- Article
- Export citation
The Complexity of Classification Problems for Models of Arithmetic
-
- Journal:
- Bulletin of Symbolic Logic / Volume 16 / Issue 3 / September 2010
- Published online by Cambridge University Press:
- 15 January 2014, pp. 345-358
- Print publication:
- September 2010
-
- Article
- Export citation