Scott S. Cramer, Inverse limit reflection and the structure of L( _V_ _λ_+1 ). Journal of Mathematical Logic, vol. 15 (2015), no. 1, p. 1550001 (38 pp.) [Book Review]
Bulletin of Symbolic Logic 26 (2):170-171 (2020)
Abstract
This article has no associated abstract. (fix it)DOI
10.1017/bsl.2020.7
My notes
Similar books and articles
Inverse limit reflection and the structure of L.Scott S. Cramer - 2015 - Journal of Mathematical Logic 15 (1):1550001.
Scott sentences for equivalence structures.Sara B. Quinn - 2020 - Archive for Mathematical Logic 59 (3-4):453-460.
Semigroups in Stable Structures.Yatir Halevi - 2018 - Notre Dame Journal of Formal Logic 59 (3):417-436.
Computable structures of rank.J. F. Knight & J. Millar - 2010 - Journal of Mathematical Logic 10 (1):31-43.
Computable structures of rank omega (ck)(1).J. F. Knight & J. Millar - 2010 - Journal of Mathematical Logic 10 (1):31-43.
A computably stable structure with no Scott family of finitary formulas.Peter Cholak, Richard A. Shore & Reed Solomon - 2006 - Archive for Mathematical Logic 45 (5):519-538.
Bounded Scott Set Saturation.Alex M. McAllister - 2002 - Mathematical Logic Quarterly 48 (2):245-259.
J. Steel, PFA implies_ AD _L_(ℝ). _ _The Journal of Symbolic Logic_ _, vol. 70 (2005), no. 4, pp. 1255–1296. - G. Sargsyan, _Nontame mouse from the failure of square at a singular strong limit cardinal_. _ _Journal of Mathematical Logic_ _, vol. 14 (2014), 1450003 (47 pages). - G. Sargsyan, _Covering with universally Baire operators_. _ _Advances in Mathematics_ _, vol. 268 (2015), pp. 603–665. - N. Trang, _PFA and guessing models_. _ _Israel Journal of Mathematics_ , vol. 215 (2016), pp. 607–667. [REVIEW]Sandra Müller - 2020 - Bulletin of Symbolic Logic 26 (1):89-92.
Coding in the automorphism group of a computably categorical structure.Dan Turetsky - 2020 - Journal of Mathematical Logic 20 (3):2050016.
Categoricity of computable infinitary theories.W. Calvert, S. S. Goncharov, J. F. Knight & Jessica Millar - 2009 - Archive for Mathematical Logic 48 (1):25-38.
LD BEKLEMISHEV Proof-theoretic analysis by iterated reflection 515 EJ GRIFFITHS Limit lemmas and jump inversion in the enumeration degrees 553.M. Kim, D. Cenzer, Pg Hinman & L. Newelski - 2003 - Archive for Mathematical Logic 42 (6):614.
Intrinsic bounds on complexity and definability at limit levels.John Chisholm, Ekaterina B. Fokina, Sergey S. Goncharov, Valentina S. Harizanov, Julia F. Knight & Sara Quinn - 2009 - Journal of Symbolic Logic 74 (3):1047-1060.
Some applications of propositional logic to cellular automata.Stefano Cavagnetto - 2009 - Mathematical Logic Quarterly 55 (6):605-616.
S. S. Goncharov. Autostability and computable families of constructivizations. Algebra and Logic, vol. 14 , no. 6, pp. 392–409. - S. S. Goncharov. The quantity of nonautoequivalent constructivizations. Algebra and Logic, vol. 16 , no. 3, pp. 169–185. - S. S. Goncharov and V. D. Dzgoev. Autostability of models. Algebra and Logic, vol. 19 , no. 1, pp. 28–37. - J. B. Remmel. Recursively categorical linear orderings. Proceedings of the American Mathematical Society, vol. 83 , no. 2, pp. 387–391. - Terrence Millar. Recursive categoricity and persistence. The Journal of Symbolic Logic, vol. 51 , 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 , 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 , no. 5, pp. 519–538. [REVIEW]Daniel Turetsky - 2012 - Bulletin of Symbolic Logic 18 (1):131-134.
Undecidability of the Real-Algebraic Structure of Scott's Model.Miklós Erdélyi-Szabó - 1998 - Mathematical Logic Quarterly 44 (3):344-348.
Analytics
Added to PP
2021-02-27
Downloads
3 (#1,316,202)
6 months
2 (#302,213)
2021-02-27
Downloads
3 (#1,316,202)
6 months
2 (#302,213)
Historical graph of downloads