Premium
Constructing κ‐like Models of Arithmetic
Author(s) -
Kaye Richard
Publication year - 1997
Publication title -
journal of the london mathematical society
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.441
H-Index - 62
eISSN - 1469-7750
pISSN - 0024-6107
DOI - 10.1112/s002461079600470x
Subject(s) - uncountable set , cofinality , cardinality (data modeling) , mathematics , countable set , extension (predicate logic) , discrete mathematics , combinatorics , arithmetic , computer science , data mining , programming language
A model ( M , <, …) is κ‐like if M has cardinality κ but, for all α ∈ M , the cardinality of { x ∈ M : x < a } is strictly less than κ. In this paper we shall give constructions of κ‐like models of arithmetic satisfying an arbitrarily large finite part of PA but not PA itself, for various singular cardinals κ. The main results are: (1) for each countable nonstandard M ⊧ Π 2 −Th(PA) with arbitrarily large initial segments satisfying PA and each uncountable κ of cofinality ω there is a cofinal extension K of M which is κ‐like; also hierarchical variants of this result for Π n −Th(PA); and (2) for every n ⩾ 1, every singular κ and every M ⊧ B ∑ n +exp+¬ I ∑ n there is a κ‐like model K elementarily equivalent to M .