Difference between revisions of "Rigid models"

Revision as of 08:57, 18 January 2013 (view source) Rkossak (Talk \| contribs) (Created page with "There are $\aleph_1$-like rigid models of $PA$. Two different constructions are given in Kossak; Schmerl, ''Minimal satisfaction classes with an application to rigid models of ...")		Latest revision as of 11:46, 23 January 2013 (view source) Rkossak (Talk \| contribs) (Blanked the page)
(One intermediate revision by the same user not shown)
Line 1:		Line 1:
−	There are $\aleph_1$-like rigid models of $PA$. Two different constructions are given in Kossak; Schmerl, ''Minimal satisfaction classes with an application to rigid models of Peano arithmetic''. Notre Dame J. Formal Logic 32 (1991), no. 3, 392–398, and Kossak; Kotlarski ''Game approximations of satisfaction classes and the problem of rather classless models''. Z. Math. Logik Grundlag. Math. 38 (1992), no. 1, 21–26.

−	~~Problem: Are there rigid recursively saturated $M\models PA$ such that ${\rm cf}(M)=\aleph_0$?~~

Latest revision as of 11:46, 23 January 2013