5 results
ITERATED PRIORITY ARGUMENTS IN DESCRIPTIVE SET THEORY
-
- Journal:
- Bulletin of Symbolic Logic / Accepted manuscript
- Published online by Cambridge University Press:
- 07 April 2024, pp. 1-23
-
- Article
-
- You have access
- Export citation
COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM
- Part of
-
- Journal:
- The Journal of Symbolic Logic / Volume 85 / Issue 4 / December 2020
- Published online by Cambridge University Press:
- 26 October 2020, pp. 1664-1686
- Print publication:
- December 2020
-
- Article
- Export citation
AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
-
- Journal:
- The Journal of Symbolic Logic / Volume 84 / Issue 4 / December 2019
- Published online by Cambridge University Press:
- 29 April 2019, pp. 1630-1669
- Print publication:
- December 2019
-
- Article
- Export citation
On Computable Field Embeddings and Difference Closed Fields
-
- Journal:
- Canadian Journal of Mathematics / Volume 69 / Issue 6 / 01 December 2017
- Published online by Cambridge University Press:
- 20 November 2018, pp. 1338-1363
- Print publication:
- 01 December 2017
-
- Article
-
- You have access
- Export citation
COMPUTABLE FUNCTORS AND EFFECTIVE INTERPRETABILITY
-
- Journal:
- The Journal of Symbolic Logic / Volume 82 / Issue 1 / March 2017
- Published online by Cambridge University Press:
- 25 January 2017, pp. 77-97
- Print publication:
- March 2017
-
- Article
- Export citation