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.

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

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.

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
Sign in / Sign up

Export Citation Format

Share Document