Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/model-theory-of-the-inaccessibility-scheme-xnJqFNaSFV
References (9)
-
S. Shelah (1978)
End extensions and numbers of countable modelsJournal of Symbolic Logic, 43
-
S. Mohsenipour (2007)
A generalization of the Keisler-Morley theorem to recursively saturated ordered structuresMLQ Math. Log. Q., 53
-
A. Enayat, S. Mohsenipour (2008)
Model theory of the regularity and reflection schemesArchive for Mathematical Logic, 47
-
H. Keisler (1968)
Models with OrderingsStudies in logic and the foundations of mathematics, 52
-
S. Mohsenipour (2008)
On Keisler singular-like modelsMLQ Math. Log. Q., 54
-
S. Mohsenipour (2007)
A generalization of the Keisler‐Morley theorem to recursively saturated ordered structuresMathematical Logic Quarterly, 53
-
S. Shelah (1999)
ON WHAT I DO NOT UNDERSTAND (AND HAVE SOMETHING TO SAY), MODEL THEORYMathematica japonicae, 51
-
Model theory of set theory -
S. Mohsenipour (2008)
On Keisler singular‐like modelsMathematical Logic Quarterly, 54
- Publisher
- Springer Journals
- Copyright
- Copyright © 2011 by Springer-Verlag
- Subject
- Mathematics; Algebra; Mathematics, general; Mathematical Logic and Foundations
- ISSN
- 0933-5846
- eISSN
- 1432-0665
- DOI
- 10.1007/s00153-011-0242-y
- Publisher site
- See Article on Publisher Site
Abstract
Suppose L = { < , . . .} is any countable first order language in which < is interpreted as a linear order. Let T be any complete first order theory in the language L such that T has a κ-like model where κ is an inaccessible cardinal. Such T proves the Inaccessibility Scheme. In this paper we study elementary end extensions of models of the inaccessibility scheme.
Journal
Archive for Mathematical Logic – Springer Journals
Published: Jun 4, 2011