Abstract

A model $(M,<,\ldots)$ is said to be $\kappa$-like if $\mbox{card $\;$} M =\kappa$ but for all $a\in M$, $\mbox{card}\{x \in M: x< a\}< \kappa$. In this paper, we shall study sentences true in $\kappa$-like models of arithmetic, especially in the cases when $\kappa$ is singular. In particular, we identify axiom schemes true in such models which are particularly `natural' from a combinatorial or model-theoretic point of view and investigate the properties of models of these schemes.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.