Maryanthe Malliaris and Saharon Shelah, Cofinality spectrum problems in model theory, set theory and general topology . Journal of the American Mathematical Society, vol. 29 (2016), pp. 237–297. - Maryanthe Malliaris and Saharon Shelah, Existence of optimal ultrafilters and the fundamental complexity of simple theories . Advances in Mathematics, vol. 290 (2016), pp. 614–681. - Maryanthe Malliaris and Saharon Shelah, Keisler’s order has infinitely many classes . Israel Journal of Mathematics, to appear, https://math.uchicago.edu/∼mem/.

2017 ◽  
Vol 23 (1) ◽  
pp. 117-121
Author(s):  
H. Jerome Keisler
Keyword(s):  
Set Theory ◽  
Model Theory ◽  
Israel Journal ◽  
American Mathematical Society ◽  
General Topology ◽  
Mathematical Society ◽  
Simple Theories

scholarly journals Applying Set Theory E88

Axioms ◽  
2021 ◽  
Vol 10 (4) ◽  
pp. 329
Author(s):  
Saharon Shelah
Keyword(s):  
Set Theory ◽  
Model Theory ◽  
Real Line ◽  
Cantor Sets ◽  
General Topology ◽  
The Real ◽  
Collectionwise Hausdorff ◽  
Monadic Logic

We prove some results in set theory as applied to general topology and model theory. In particular, we study ℵ1-collectionwise Hausdorff, Chang Conjecture for logics with Malitz-Magidor quantifiers and monadic logic of the real line by odd/even Cantor sets.

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