- 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
A direct proof of the five element basis theorem
Mathematical Logic Quarterly 63 (3-4):289-298 (2017)
Abstract
We present a direct proof of the consistency of the existence of a five element basis for the uncountable linear orders. Our argument is based on the approach of König, Larson, Moore and Veličković and simplifies the original proof of Moore.Author's Profile
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
A constructive proof of the Peter‐Weyl theorem.Thierry Coquand & Bas Spitters - 2005 - Mathematical Logic Quarterly 51 (4):351-359.
Negation-Free and Contradiction-Free Proof of the Steiner–Lehmus Theorem.Victor Pambuccian - 2018 - Notre Dame Journal of Formal Logic 59 (1):75-90.
An Intuitionistic Version of Zermelo's Proof That Every Choice Set Can Be Well-Ordered.J. Wilson - 2001 - Journal of Symbolic Logic 66 (3):1121-1126.
An intuitionistic version of zermelo's proof that every choice set can be well-ordered.J. Todd Wilson - 2001 - Journal of Symbolic Logic 66 (3):1121-1126.
Weak König's Lemma Implies Brouwer's Fan Theorem: A Direct Proof.Hajime Ishihara - 2006 - Notre Dame Journal of Formal Logic 47 (2):249-252.
A proofless proof of the Barwise compactness theorem.Mark Howard - 1988 - Journal of Symbolic Logic 53 (2):597-602.
The Kinds of Truth of Geometry Theorems.Michael Bulmer, Desmond Fearnley-Sander & Tim Stokes - 2001 - In Jürgen Richter-Gebert & Dongming Wang (eds.), LNCS: Lecture Notes In Computer Science. Springer Verlag. pp. 129-142.
Gleason's theorem has a constructive proof.Fred Richman - 2000 - Journal of Philosophical Logic 29 (4):425-431.
Tait's conservative extension theorem revisited.Ryota Akiyoshi - 2010 - Journal of Symbolic Logic 75 (1):155-167.
A basis theorem for perfect sets.Marcia J. Groszek & Theodore A. Slaman - 1998 - Bulletin of Symbolic Logic 4 (2):204-209.
A proof of the normal form theorem for the closed terms of Girard's system F by means of computability.Silvio Valentini - 1993 - Mathematical Logic Quarterly 39 (1):539-544.
On the strength of Ramsey's theorem for pairs.Peter A. Cholak, Carl G. Jockusch & Theodore A. Slaman - 2001 - Journal of Symbolic Logic 66 (1):1-55.
The automorphism tower of a centerless group without Choice.Itay Kaplan & Saharon Shelah - 2009 - Archive for Mathematical Logic 48 (8):799-815.
Some applications of computable one-one numberings.Martin Kummer - 1990 - Archive for Mathematical Logic 30 (4):219-230.
Analytics
Added to PP
2017-10-29
Downloads
29 (#548,607)
6 months
10 (#263,328)
2017-10-29
Downloads
29 (#548,607)
6 months
10 (#263,328)
Historical graph of downloads
Author's Profile
References found in this work
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-64dd777598-g9b9l uwo