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.

Daniel Turetsky

doi:10.1017/s1079898600000287

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.

Bulletin of Symbolic Logic ◽

10.1017/s1079898600000287 ◽

2012 ◽

Vol 18 (1) ◽

pp. 131-134

Author(s):

Daniel Turetsky

Keyword(s):

Mathematical Logic ◽

Model Theory ◽

American Mathematical Society ◽

Effective Model ◽

Mathematical Society ◽

Symbolic Logic ◽

Applied Logic ◽

Recursive Model ◽

Linear Orderings ◽

Scott Family

Download Full-text

James Cummings. A model in which GCH holds at successors but fails at limits. Transactions of the American Mathematical Society, vol. 329 (1992), pp. 1–39. - James Cummings. Strong ultrapowers and long core models. The journal of symbolic logic, vol. 58 (1993), pp. 240–248. - James Cummings. Coherent sequences versus Radin sequences. Annals of pure and applied logic, vol. 70 (1994), pp. 223–241. - James Cummings, Matthew Foreman, and Menachem Magidor. Squares, scales and stationary reflection. Journal of mathematical logic, vol. 1 (2001), pp. 35–98.

Bulletin of Symbolic Logic ◽

10.2178/bsl/1182353938 ◽

2002 ◽

Vol 8 (4) ◽

pp. 550-552

Author(s):

Arthur W. Apter

Keyword(s):

Mathematical Logic ◽

American Mathematical Society ◽

Mathematical Society ◽

Symbolic Logic ◽

Stationary Reflection ◽

Applied Logic

Download Full-text

Arthur W. Apter. On the least strongly compact cardinal. Israel journal of mathematics, vol. 35 (1980), pp. 225–233. - Arthur W. Apter. Measurability and degrees of strong compactness. The journal of symbolic logic, vol. 46 (1981), pp. 249–254. - Arthur W. Apter. A note on strong compactness and supercompactness. Bulletin of the London Mathematical Society, vol. 23 (1991), pp. 113–115. - Arthur W. Apter. On the first n strongly compact cardinals. Proceedings of the American Mathematical Society, vol. 123 (1995), pp. 2229–2235. - Arthur W. Apter and Saharon Shelah. On the strong equality between supercompactness and strong compactness.. Transactions of the American Mathematical Society, vol. 349 (1997), pp. 103–128. - Arthur W. Apter and Saharon Shelah. Menas' result is best possible. Ibid., pp. 2007–2034. - Arthur W. Apter. More on the least strongly compact cardinal. Mathematical logic quarterly, vol. 43 (1997), pp. 427–430. - Arthur W. Apter. Laver indestructibility and the class of compact cardinals. The journal of symbolic logic, vol. 63 (1998), pp. 149–157. - Arthur W. Apter. Patterns of compact cardinals. Annals of pure and applied logic, vol. 89 (1997), pp. 101–115. - Arthur W. Apter and Moti Gitik. The least measurable can be strongly compact and indestructible. The journal of symbolic logic, vol. 63 (1998), pp. 1404–1412.

Bulletin of Symbolic Logic ◽

10.2307/421078 ◽

2000 ◽

Vol 6 (1) ◽

pp. 86-89

Author(s):

James W. Cummings

Keyword(s):

Israel Journal ◽

American Mathematical Society ◽

London Mathematical Society ◽

Mathematical Society ◽

Symbolic Logic ◽

Strongly Compact Cardinal ◽

Compact Cardinal ◽

Applied Logic ◽

Strong Compactness ◽

Strongly Compact Cardinals

Download Full-text

Five papers on reverse mathematics and Ramsey-theoretic principles - C. T. Chong, Theodore A. Slaman, and Yue Yang, The metamathematics of Stable Ramsey’s Theorem for Pairs. Journal of the American Mathematical Society, vol. 27 (2014), no. 3, pp. 863–892. - Manuel Lerman, Reed Solomon, and Henry Towsner, Separating principles below Ramsey’s Theorem for Pairs. Journal of Mathematical Logic, vol. 13 (2013), no. 2, 1350007, 44 pp. - Jiayi Liu, $RT_2^^2$ does not imply WKL0. Journal of Symbolic Logic, vol. 77 (2012), no. 2, pp. 609–620. - Lu Liu, Cone avoiding closed sets. Transactions of the American Mathematical Society, vol. 367 (2015), no. 3, pp. 1609–1630. - Wei Wang, Some logically weak Ramseyan theorems. Advances in Mathematics, vol. 261 (2014), pp. 1–25.

Bulletin of Symbolic Logic ◽

10.1017/bsl.2016.32 ◽

2016 ◽

Vol 22 (4) ◽

pp. 526-530

Author(s):

Denis R. Hirschfeldt

Keyword(s):

Mathematical Logic ◽

American Mathematical Society ◽

Reverse Mathematics ◽

Mathematical Society ◽

Symbolic Logic ◽

Ramsey's Theorem ◽

Closed Sets ◽

Ramsey’S Theorem

Download Full-text

Leo Harrington. Recursively presentable prime models. The journal of symbolic logic, vol. 39 (1974), pp. 305–309. - Terrences. Millar. Foundations of recursive model theory. Annals of mathematical logic, vol. 13 (1978), pp. 45–72. - Terrence S. Millar. A complete, decidable theory with two decidable models. The journal of symbolic logic, vol. 44 (1979), pp. 307–312.

Journal of Symbolic Logic ◽

10.2307/2274207 ◽

1984 ◽

Vol 49 (2) ◽

pp. 671-672

Author(s):

C. J. Ash

Keyword(s):

Mathematical Logic ◽

Model Theory ◽

Symbolic Logic ◽

Recursive Model ◽

Decidable Theory

Download Full-text

Bradd Hart and Matthew Valeriote. A structure theorem for strongly abelian varieties with few models. The journal of symbolic logic, vol. 56 (1991), pp. 832–852. - Bradd Hart and Sergei Starchenko. Addendum to “A structure theorem for strongly abelian varieties.”The journal of symbolic logic., vol. 58 (1993), pp. 1419–1425. - Bradd Hart, Sergei Starchenko, and Matthew Valeriote. Vaught's conjecture for varieties. Transactions of the American Mathematical Society, vol. 342 (1994), pp. 173–196. - B. Hart and S. Starchenko. Superstable quasi-varieties. Annals of pure and applied logic, vol. 69 (1994), pp. 53–71. - B. Hart, A. Pillay, and S. Starchenko. Triviality, NDOP and stable varieties. Annals of pure and applied logic., vol. 62 (1993), pp. 119–146.

Journal of Symbolic Logic ◽

10.2307/2586814 ◽

1999 ◽

Vol 64 (4) ◽

pp. 1820-1821

Author(s):

Ralph McKenzie

Keyword(s):

Structure Theorem ◽

Abelian Varieties ◽

American Mathematical Society ◽

Mathematical Society ◽

Symbolic Logic ◽

Applied Logic

Download Full-text

S. C. Kleene. Permutability of inferences in Gentzen's calculi LK and LJ. Two papers on the predicate calculus, by S. C. Kleene (Memoirs of the American Mathematical Society, no. 10), lithographed, Providence1952, pp. 1–26. - S. C. Kleene. Finite axiomatizability of theories in the predicate calculus using additional predicate symbols. Two papers on the predicate calculus, by S. C. Kleene (Memoirs of the American Mathematical Society, no. 10), lithographed, Providence1952, pp. 27–66. - S. C. Kleene. Bibliography. Two papers on the predicate calculus, by S. C. Kleene (Memoirs of the American Mathematical Society, no. 10), lithographed, Providence1952, pp. 67–68. - William Craig. On axiomatizability within a system. The journal of symbolic logic, vol. 18 (1953), pp. 30–32.

Journal of Symbolic Logic ◽

10.2307/2267666 ◽

1954 ◽

Vol 19 (1) ◽

pp. 62-63

Author(s):

Robert McNaughton

Keyword(s):

American Mathematical Society ◽

Predicate Calculus ◽

Mathematical Society ◽

Symbolic Logic ◽

Finite Axiomatizability

Download Full-text

Antonio Montalbán, Indecomposable linear orderings and hyperarithmetic analysis. Journal of Mathematical Logic, vol. 6 (2006), no. 1, pp. 89–120. - Itay Neeman, The strength of Jullien’s indecomposability theorem. Journal of Mathematical Logic, vol. 8 (2008), no. 1, pp. 93–119. - Itay Neeman, Necessary use ofinduction in a reversal. Journal of Symbolic Logic, vol. 76 (2011), no. 2, pp. 561–574.

Bulletin of Symbolic Logic ◽

10.1017/bsl.2014.28 ◽

2014 ◽

Vol 20 (3) ◽

pp. 366-368

Author(s):

Henry Towsner

Keyword(s):

Mathematical Logic ◽

Symbolic Logic ◽

Linear Orderings

Download Full-text

M. O. Rabin. Computable algebraic systems. Summaries of talks presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, 2nd edn., Communications Research Division, Institute for Defense Analyses, Princeton, N.J., 1960, pp. 134–138. - Michael O. Rabin. Computable algebra, general theory and theory of computable fields. Transactions of the American Mathematical Society, vol. 95 (1960), pp. 341–360.

Journal of Symbolic Logic ◽

10.2307/2270825 ◽

1967 ◽

Vol 32 (3) ◽

pp. 412-413

Author(s):

B. H. Mayoh

Keyword(s):

General Theory ◽

American Mathematical Society ◽

Mathematical Society ◽

Symbolic Logic ◽

Summer Institute ◽

Algebraic Systems ◽

Cornell University ◽

Research Division

Download Full-text

Thomas Jech and Karel Prikry. On ideals of sets and the power set operation. Bulletin of the American Mathematical Society, vol. 82 (1976), pp. 593–595. - F. Galvin, T. Jech, and M. Magidor. An ideal game. The journal of symbolic logic, vol. 43 (1978), pp. 284–292. - T. Jech, M. Magidor, W. Mitchell, and K. Prikry. Precipitous ideals. The journal of symbolic logic, vol. 45 (1980), pp. 1–8. - Yuzuru Kakuda. On a condition for Cohen extensions which preserve precipitous ideals. The journal of symbolic logic, vol. 46(1981), pp. 296–300. - Thomas Jech and Karel Prikry. Ideals over uncountable sets: application of almost disjoint functions and generic ultrapowers. Memoirs of the American Mathematical Society, no. 214. American Mathematical Society, Providence 1979, iii + 71 pp. - Menachem Magidor. Precipitous ideals and sets. Israel journal of mathematics, vol. 35 (1980), pp. 109–134.

Journal of Symbolic Logic ◽

10.2307/2273805 ◽

1985 ◽

Vol 50 (1) ◽

pp. 239-240

Author(s):

James E. Baumgartner

Keyword(s):

Israel Journal ◽

American Mathematical Society ◽

Mathematical Society ◽

Symbolic Logic ◽

Power Set ◽

Almost Disjoint ◽

Generic Ultrapowers ◽

Precipitous Ideals ◽

Set Operation

Download Full-text

David W. Kueker. Löwenheim–Skolem and interpolation theorems in infinitary languages. Bulletin of the American Mathematical Society, vol. 78 (1972), pp. 211–215. - K. Jon Barwise. Mostowski's collapsing function and the closed unbounded filter. Fundamenta mathematicae, vol. 82 no. 2 (1974), pp. 95–103. - David W. Kueker. Countable approximations and Löwenheim–Skolem theorems. Annals of mathematical logic, vol. 11 (1977), pp. 57–103.

Journal of Symbolic Logic ◽

10.2307/2273961 ◽

1986 ◽

Vol 51 (1) ◽

pp. 232-234

Author(s):

Victor Harnik

Keyword(s):

Mathematical Logic ◽

American Mathematical Society ◽

Mathematical Society ◽

Collapsing Function

Download Full-text