- 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
The Boolean Prime Ideal Theorem Plus Countable Choice Do Not Imply Dependent Choice
Mathematical Logic Quarterly 42 (1):410-420 (1996)
Abstract
Two Fraenkel-Mostowski models are constructed in which the Boolean Prime Ideal Theorem is true. In both models, AC for countable sets is true, but AC for sets of cardinality 2math image and the 2m = m principle are both false. The Principle of Dependent Choices is true in the first model, but false in the secondOther Versions
No versions found
My notes
Similar books and articles
Limitations on the Fraenkel-Mostowski method of independence proofs.Paul E. Howard - 1973 - Journal of Symbolic Logic 38 (3):416-422.
MA(ℵ0) restricted to complete Boolean algebras and choice.Eleftherios Tachtsis - 2021 - Mathematical Logic Quarterly 67 (4):420-431.
On vector spaces over specific fields without choice.Paul Howard & Eleftherios Tachtsis - 2013 - Mathematical Logic Quarterly 59 (3):128-146.
The Independence of the Prime Ideal Theorem from the Order-Extension Principle.U. Felgner & J. K. Truss - 1999 - Journal of Symbolic Logic 64 (1):199-215.
The independence of the prime ideal theorem from the order-extension principle.U. Felgner & J. K. Truss - 1999 - Journal of Symbolic Logic 64 (1):199-215.
The Boolean prime ideal theorem and products of cofinite topologies.Kyriakos Keremedis - 2013 - Mathematical Logic Quarterly 59 (6):382-392.
A note on the deductive strength of the Nielsen‐Schreier theorem.Eleftherios Tachtsis - 2018 - Mathematical Logic Quarterly 64 (3):173-177.
Models of $${{\textsf{ZFA}}}$$ in which every linearly ordered set can be well ordered.Paul Howard & Eleftherios Tachtsis - 2023 - Archive for Mathematical Logic 62 (7):1131-1157.
Analytics
Added to PP
2013-12-01
Downloads
54 (#394,030)
6 months
7 (#669,170)
2013-12-01
Downloads
54 (#394,030)
6 months
7 (#669,170)
Historical graph of downloads
Citations of this work
On the Deductive Strength of Various Distributivity Axioms for Boolean Algebras in Set Theory.Yasuo Kanai - 2002 - Mathematical Logic Quarterly 48 (3):413-426.
No Decreasing Sequence of Cardinals in the Hierarchy of Choice Principles.Eleftherios Tachtsis - 2024 - Notre Dame Journal of Formal Logic 65 (3):311-331.
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-667477cd97-wmc4m dc2