Research Article
The Absolute Arithmetic Continuum and the Unification Of all Numbers Great and Small
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 1-45
-
- Article
- Export citation
In Praise of Replacement
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 46-90
-
- Article
- Export citation
Second Order Logic or Set Theory?
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 91-121
-
- Article
- Export citation
Reviews
Games, scales, and Suslin cardinals. The Cabal Seminar, Volume I, edited by A. S. Kechris, B. Löwe, and J. R. Steel, Lecture Notes in Logic, vol. 31. Association for Symbolic Logic and Cambridge University Press, Cambridge, 2008, xi + 445 pp.
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 122-126
-
- Article
- Export citation
Rodney G. Downey and Denis R. Hirschfeldt. Algorithmic randomness and complexity. Theory and Applications of Computability. Springer, 2010, xxviii + 855 pp.
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 126-128
-
- Article
- Export citation
Foundational theories of classical and constructive mathematics, edited by Giovanni Sommaruga, Springer, 2011. xi + 314 pp.
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 128-131
-
- 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.
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 131-134
-
- Article
- Export citation
Meeting Report
2011 Spring Meeting of the Association for Symbolic Logic
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 135-141
-
- Article
- Export citation
2010–2011 Winter Meeting of the Association for Symbolic Logic
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 142-149
-
- Article
- Export citation
XVI brazilian Logic Conference
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 150-151
-
- Article
- Export citation
18th Workshop on Logic, Language, Information and Computation (Wollic 2011)
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 152-153
-
- Article
- Export citation
Other
Notices
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 154-160
-
- Article
- Export citation
Front matter
BSL volume 18 issue 1 Cover and Front matter
-
- Published online by Cambridge University Press:
- 05 September 2014, pp. f1-f3
-
- Article
-
- You have access
- Export citation
Back matter
BSL volume 18 issue 1 Cover and Back matter
-
- Published online by Cambridge University Press:
- 05 September 2014, pp. b1-b2
-
- Article
-
- You have access
- Export citation