- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Order types of ordinals in models of set theory
Journal of Symbolic Logic 41 (2):489-502 (1976)
Abstract
An ordinal in a model of set theory is truly countable if its set of predecessors is countable in the real world. We classify the order types of the sets of truly countable ordinals. Models with indiscernibles and other related results are discussedLinks
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
The largest countable inductive set is a mouse set.Mitch Rudominer - 1999 - Journal of Symbolic Logic 64 (2):443-459.
Constructible models of subsystems of ZF.Richard Gostanian - 1980 - Journal of Symbolic Logic 45 (2):237-250.
Skolem's Paradox.Timothy Bays - 2012 - In Peter Adamson (ed.), Stanford Encyclopedia of Philosophy. Stanford Encyclopedia of Philosophy.
The model of set theory generated by countably many generic reals.Andreas Blass - 1981 - Journal of Symbolic Logic 46 (4):732-752.
Categoricity theorems and conceptions of set.Gabriel Uzquiano - 2002 - Journal of Philosophical Logic 31 (2):181-196.
A Covering Lemma for HOD of K (ℝ).Daniel W. Cunningham - 2010 - Notre Dame Journal of Formal Logic 51 (4):427-442.
Slim models of zermelo set theory.A. R. D. Mathias - 2001 - Journal of Symbolic Logic 66 (2):487-496.
Elementary extensions of countable models of set theory.John E. Hutchinson - 1976 - Journal of Symbolic Logic 41 (1):139-145.
Analytics
Added to PP
2009-01-28
Downloads
23 (#664,515)
6 months
6 (#504,917)
2009-01-28
Downloads
23 (#664,515)
6 months
6 (#504,917)
Historical graph of downloads
Citations of this work
Stationary logic of finitely determinate structures.P. C. Eklof - 1979 - Annals of Mathematical Logic 17 (3):227.
References found in this work
Some applications of model theory in set theory.Jack H. Silver - 1971 - Annals of Mathematical Logic 3 (1):45.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-7c76586df8-l2pxr uwo