Characterizing all models in infinite cardinalities

Annals of Pure and Applied Logic 164 (3):230-250 (2013)
  Copy   BIBTEX

Abstract

Fix a cardinal κ. We can ask the question: what kind of a logic L is needed to characterize all models of cardinality κ up to isomorphism by their L-theories? In other words: for which logics L it is true that if any models A and B of cardinality κ satisfy the same L-theory then they are isomorphic?It is always possible to characterize models of cardinality κ by their Lκ+,κ+-theories, but we are interested in finding a “small” logic L, i.e., the sentences of L are hereditarily of smaller cardinality than κ. For any cardinal κ it is independent of ZFC whether any such small definable logic L exists. If it exists it can be second order logic for κ=ω and fourth order logic or certain infinitary second order logic Lκ,ω source for uncountable κ. All models of cardinality κ can always be characterized by their theories in a small logic with generalized quantifiers, but the logic may be not definable in the language of set theory. Our work continues and extends the work of Ajtai [Miklos Ajtai, Isomorphism and higher order equivalence, Ann. Math. Logic 16 181–203]

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Theories with models of prescribed cardinalities.Alan Mekler - 1977 - Journal of Symbolic Logic 42 (2):251-253.
Potential infinite models and ontologically neutral logic.Theodore Hailperin - 2001 - Journal of Philosophical Logic 30 (1):79-96.
Toward model-theoretic modal logics.Minghui Ma - 2010 - Frontiers of Philosophy in China 5 (2):294-311.
More constructions for Boolean algebras.Saharon Shelah - 2002 - Archive for Mathematical Logic 41 (5):401-441.
Reflections on Skolem's Paradox.Timothy Bays - 2000 - Dissertation, University of California, Los Angeles
Infinite chains and antichains in computable partial orderings.E. Herrmann - 2001 - Journal of Symbolic Logic 66 (2):923-934.

Analytics

Added to PP
2013-12-12

Downloads
43 (#360,193)

6 months
6 (#522,885)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Model-Theoretic Logics.Jon Barwise & Solomon Feferman - 2017 - Cambridge University Press.
Completeness in the theory of types.Leon Henkin - 1950 - Journal of Symbolic Logic 15 (2):81-91.
Set theory.Thomas Jech - 1981 - Journal of Symbolic Logic.
Set Theory.Thomas Jech - 1999 - Studia Logica 63 (2):300-300.

View all 15 references / Add more references