- 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
Independence of Boolean algebras and forcing
Annals of Pure and Applied Logic 124 (1-3):179-191 (2003)
Abstract
If κω is a cardinal, a complete Boolean algebra is called κ-dependent if for each sequence bβ: β<κ of elements of there exists a partition of the unity, P, such that each pP extends bβ or bβ′, for κ-many βκ. The connection of this property with cardinal functions, distributivity laws, forcing and collapsing of cardinals is consideredMy notes
Similar books and articles
Unsupported Boolean algebras and forcing.Miloš S. Kurilić - 2004 - Mathematical Logic Quarterly 50 (6):594-602.
On uncountable cardinal sequences for superatomic Boolean algebras.Juan Carlos Martínez - 1995 - Archive for Mathematical Logic 34 (4):257-261.
Filters and large cardinals.Jean-Pierre Levinski - 1995 - Annals of Pure and Applied Logic 72 (2):177-212.
Superatomic Boolean algebras constructed from strongly unbounded functions.Juan Carlos Martínez & Lajos Soukup - 2011 - Mathematical Logic Quarterly 57 (5):456-469.
Power-collapsing games.Miloš S. Kurilić & Boris Šobot - 2008 - Journal of Symbolic Logic 73 (4):1433-1457.
Superatomic Boolean algebras constructed from morasses.Peter Koepke & Juan Carlos Martínez - 1995 - Journal of Symbolic Logic 60 (3):940-951.
A Note on Boolean Algebras with Few Partitions Modulo some Filter.Markus Huberich - 1996 - Mathematical Logic Quarterly 42 (1):172-174.
The lottery preparation.Joel David Hamkins - 2000 - Annals of Pure and Applied Logic 101 (2-3):103-146.
The tree property and the failure of SCH at uncountable cofinality.Dima Sinapova - 2012 - Archive for Mathematical Logic 51 (5-6):553-562.
Property {(hbar)} and cellularity of complete Boolean algebras.Miloš S. Kurilić & Stevo Todorčević - 2009 - Archive for Mathematical Logic 48 (8):705-718.
Analytics
Added to PP
2014-01-16
Downloads
24 (#155,087)
6 months
2 (#1,816,284)
2014-01-16
Downloads
24 (#155,087)
6 months
2 (#1,816,284)
Historical graph of downloads
Citations of this work
A posteriori convergence in complete Boolean algebras with the sequential topology.Miloš S. Kurilić & Aleksandar Pavlović - 2007 - Annals of Pure and Applied Logic 148 (1-3):49-62.
Mad families, forcing and the Suslin Hypothesis.Miloš S. Kurilić - 2005 - Archive for Mathematical Logic 44 (4):499-512.
References found in this work
Iterated perfect-set forcing.James E. Baumgartner & Richard Laver - 1979 - Annals of Mathematical Logic 17 (3):271-288.
Almost-disjoint sets the dense set problem and the partition calculus.James E. Baumgartner - 1976 - Annals of Mathematical Logic 9 (4):401-439.
Perfect-set forcing for uncountable cardinals.Akihiro Kanamori - 1980 - Annals of Mathematical Logic 19 (1-2):97-114.
Minimal collapsing extensions of models of zfc.Lev Bukovský & Eva Copláková-Hartová - 1990 - Annals of Pure and Applied Logic 46 (3):265-298.
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-6686886f5-2nz2h uwo