- 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
Linear orderings and powers of characterizable cardinals
Annals of Pure and Applied Logic 163 (3):225-237 (2012)
Abstract
This article has no associated abstract. (fix it)Links
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
Subtle cardinals and linear orderings.Harvey M. Friedman - 2000 - Annals of Pure and Applied Logic 107 (1-3):1-34.
A recursion principle for linear orderings.Juha Oikkonen - 1992 - Journal of Symbolic Logic 57 (1):82-96.
On Computable Self-Embeddings of Computable Linear Orderings.Rodney G. Downey, Bart Kastermans & Steffen Lempp - 2009 - Journal of Symbolic Logic 74 (4):1352 - 1366.
A coding of the countable linear orderings.Patrick Dehornoy - 1990 - Studia Logica 49 (4):585 - 590.
A construction for recursive linear orderings.C. J. Ash - 1991 - Journal of Symbolic Logic 56 (2):673-683.
Up to Equimorphism, Hyperarithmetic Is Recursive.Antonio Montalbán - 2005 - Journal of Symbolic Logic 70 (2):360 - 378.
Nonexistence of universal orders in many cardinals.Menachem Kojman & Saharon Shelah - 1992 - Journal of Symbolic Logic 57 (3):875-891.
Universally baire sets and definable well-orderings of the reals.Sy D. Friedman & Ralf Schindler - 2003 - Journal of Symbolic Logic 68 (4):1065-1081.
Notions of relative ubiquity for invariant sets of relational structures.Paul Bankston & Wim Ruitenburg - 1990 - Journal of Symbolic Logic 55 (3):948-986.
Gap forcing: Generalizing the lévy-Solovay theorem.Joel David Hamkins - 1999 - Bulletin of Symbolic Logic 5 (2):264-272.
On the equimorphism types of linear orderings.Antonio Montalbán - 2007 - Bulletin of Symbolic Logic 13 (1):71-99.
Recursive linear orderings and hyperarithmetical functions.Shih-Chao Liu - 1962 - Notre Dame Journal of Formal Logic 3 (3):129-132.
Analytics
Added to PP
2013-10-27
Downloads
21 (#731,064)
6 months
9 (#299,238)
2013-10-27
Downloads
21 (#731,064)
6 months
9 (#299,238)
Historical graph of downloads
Citations of this work
Complete Lω1,ω‐sentences with maximal models in multiple cardinalities.John Baldwin & Ioannis Souldatos - 2019 - Mathematical Logic Quarterly 65 (4):444-452.
Notes on Cardinals That Are Characterizable by a Complete (Scott) Sentence.Ioannis Souldatos - 2014 - Notre Dame Journal of Formal Logic 55 (4):533-551.
References found in this work
Almost-disjoint sets the dense set problem and the partition calculus.James E. Baumgartner - 1976 - Annals of Mathematical Logic 9 (4):401-439.
Knight's model, its automorphism group, and characterizing the uncountable cardinals.Greg Hjorth - 2002 - Journal of Mathematical Logic 2 (01):113-144.
A complete L ω1ω-sentence characterizing ℵ1.Julia F. Knight - 1977 - Journal of Symbolic Logic 42 (1):59-62.
The Hanf number for complete lω1, ω-sentences (without GCH).James E. Baumgartner - 1974 - Journal of Symbolic Logic 39 (3):575 - 578.
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-659b74868d-jrkjf uwo