9 results
LIMIT COMPLEXITIES, MINIMAL DESCRIPTIONS, AND $n$-RANDOMNESS
-
- Journal:
- The Journal of Symbolic Logic / Accepted manuscript
- Published online by Cambridge University Press:
- 05 June 2024, pp. 1-16
-
- Article
- Export citation
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
PUNCTUAL CATEGORICITY AND UNIVERSALITY
- Part of
-
- Journal:
- The Journal of Symbolic Logic / Volume 85 / Issue 4 / December 2020
- Published online by Cambridge University Press:
- 22 October 2020, pp. 1427-1466
- Print publication:
- December 2020
-
- Article
- Export citation
UNIFORM PROCEDURES IN UNCOUNTABLE STRUCTURES
-
- Journal:
- The Journal of Symbolic Logic / Volume 83 / Issue 2 / June 2018
- Published online by Cambridge University Press:
- 01 August 2018, pp. 529-550
- Print publication:
- June 2018
-
- Article
- Export citation
LINEAR ORDERS REALIZED BY C.E. EQUIVALENCE RELATIONS
-
- Journal:
- The Journal of Symbolic Logic / Volume 81 / Issue 2 / June 2016
- Published online by Cambridge University Press:
- 03 May 2016, pp. 463-482
- Print publication:
- June 2016
-
- Article
- Export citation
COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS I: COMPUTABLE CATEGORICITY
-
- Journal:
- The Journal of Symbolic Logic / Volume 80 / Issue 1 / March 2015
- Published online by Cambridge University Press:
- 13 March 2015, pp. 116-144
- Print publication:
- March 2015
-
- Article
- Export citation
COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS II: DEGREE SPECTRA
-
- Journal:
- The Journal of Symbolic Logic / Volume 80 / Issue 1 / March 2015
- Published online by Cambridge University Press:
- 13 March 2015, pp. 145-178
- Print publication:
- March 2015
-
- Article
- Export citation
S. S. Goncharov. Autostability and computable families of constructivizations. Algebra and Logic, vol. 14 (1975), no. 6, pp. 392–409. - S. S. Goncharov. The quantity of nonautoequivalent constructivizations. Algebra and Logic, vol. 16 (1977), no. 3, pp. 169–185. - S. S. Goncharov and V. D. Dzgoev. Autostability of models. Algebra and Logic, vol. 19 (1980), no. 1, pp. 28–37. - J. B. Remmel. Recursively categorical linear orderings. Proceedings of the American Mathematical Society, vol. 83 (1981), no. 2, pp. 387–391. - Terrence Millar. Recursive categoricity and persistence. The Journal of Symbolic Logic, vol. 51 (1986), no. 2, pp. 430–434. - Peter Cholak, Segey Goncharov, Bakhadyr Khoussainov and Richard A. Shore. Computably categorical structures and expansions by constants. The Journal of Symbolic Logic, vol. 64 (1999), no. 1, pp. 13–137. - Peter Cholak, Richard A. Shore and Reed Solomon. A computably stable structure with no Scott family of finitary formulas. Archive for Mathematical Logic, vol. 45 (2006), no. 5, pp. 519–538. - Chris Ash, Julia Knight, Mark Manasse and Theodore Slaman. Generic copies of countable structures. Annals of Pure and Applied Logic, vol. 42 (1989), no. 3, pp. 195–205. - John Chisholm. Effective model theory vs. recursive model theory. The Journal of Symbolic Logic, vol. 55 (1990), no. 3, pp. 1168–1191.
-
- Journal:
- Bulletin of Symbolic Logic / Volume 18 / Issue 1 / March 2012
- Published online by Cambridge University Press:
- 15 January 2014, pp. 131-134
- Print publication:
- March 2012
-
- Article
- Export citation
Limitwise monotonic functions, sets, and degrees on computable domains
-
- Journal:
- The Journal of Symbolic Logic / Volume 75 / Issue 1 / March 2010
- Published online by Cambridge University Press:
- 12 March 2014, pp. 131-154
- Print publication:
- March 2010
-
- Article
- Export citation