论文信息 - Models of Peano Arithmetic and a question of Sikorski on ordered fields

Models of Peano Arithmetic and a question of Sikorski on ordered fields

Using models of Peano Arithmetic, we solve a problem of Sikorski by showing that the existence of an ordered field of cardinalityλ with the Bolzano-Weierstrass property forκ-sequences is equivalent to the existence of aκ-tree with exactlyλ branches and with noκ-Aronszajn subtrees.

James H. Schmerl

[1] James H. Schmerl. Recursively saturated, rather classless models of peano arithmetic , 1981 .

[2] J. Schmerl,et al. Peano Models with Many Generic Classes , 1973 .

[3] Keith Devlin,et al. The combinatorial principle ⋄# , 1982, Journal of Symbolic Logic.

[4] I. Juhász,et al. On a problem of Sikorski , 1978 .

[5] K. Devlin. Order types, trees, and a problem of Erdős and Hajnal , 1974 .

[6] Lindelöf models of the reals: Solution to a problem of Sikorski , 1983 .

[7] Stevo Todorcevic,et al. Trees, subtrees and order types , 1981 .

[8] R. Sikorski. Remarks on some topological spaces of high power , 1950 .

[9] Saharon Shelah,et al. Models with second order properties II. Trees with no undefined branches , 1978 .

[10] K. Devlin. A new construction of a Kurepa tree with no Aronszajn subtree , 1983 .

[11] Daniel J. Velleman. Morasses, diamond, and forcing , 1982, Ann. Math. Log..

[12] James Henry Schmerl. Correction to: ``Peano models with many generic classes''. , 1981 .

[13] Matt Kaufmann,et al. A rather classless model , 1977 .

[14] H. Jerome Keisler. Monotone complete fields , 1974 .

[15] John Cowles,et al. Generalized Archimedean fields , 1983, Notre Dame J. Formal Log..

[16] G. Cherlin. Model theoretic algebra: Selected topics , 1976 .