- 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
Combinatorics on ideals and forcing with trees
Journal of Symbolic Logic 52 (3):582-593 (1987)
Abstract
Classes of forcings which add a real by forcing with branching conditions are examined, and conditions are found which guarantee that the generic real is of minimal degree over the ground model. An application is made to almost-disjoint coding via a real of minimal degreeLinks
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
Forcing minimal degree of constructibility.Haim Judah & Saharon Shelah - 1991 - Journal of Symbolic Logic 56 (3):769-782.
Forcing with Δ perfect trees and minimal Δ-degrees.Alexander S. Kechris - 1981 - Journal of Symbolic Logic 46 (4):803 - 816.
A combinatorial forcing for coding the universe by a real when there are no sharps.Saharon Shelah & Lee J. Stanley - 1995 - Journal of Symbolic Logic 60 (1):1-35.
Forcing in łukasiewicz predicate logic.Antonio Di Nola, George Georgescu & Luca Spada - 2008 - Studia Logica 89 (1):111-145.
C. C. C. forcing without combinatorics.Alan H. Mekler - 1984 - Journal of Symbolic Logic 49 (3):830-832.
Analytics
Added to PP
2009-01-28
Downloads
229 (#84,024)
6 months
9 (#242,802)
2009-01-28
Downloads
229 (#84,024)
6 months
9 (#242,802)
Historical graph of downloads
Citations of this work
Uncountable superperfect forcing and minimality.Elizabeth Theta Brown & Marcia J. Groszek - 2006 - Annals of Pure and Applied Logic 144 (1-3):73-82.
Mathias–Prikry and Laver type forcing; summable ideals, coideals, and +-selective filters.David Chodounský, Osvaldo Guzmán González & Michael Hrušák - 2016 - Archive for Mathematical Logic 55 (3-4):493-504.
Fresh function spectra.Vera Fischer, Marlene Koelbing & Wolfgang Wohofsky - 2023 - Annals of Pure and Applied Logic 174 (9):103300.
Grigorieff Forcing on Uncountable Cardinals Does Not Add a Generic of Minimal Degree.Brooke M. Andersen & Marcia J. Groszek - 2009 - Notre Dame Journal of Formal Logic 50 (2):195-200.
References found in this work
Some applications of almost disjoint forcing.R. B. Jensen & R. M. Solovay - 1970 - In Yehoshua Bar-Hillel (ed.), Mathematical Logic and Foundations of Set Theory. Amsterdam: North-Holland Pub. Co..
Combinatorics on ideals and forcing.Serge Grigorieff - 1971 - Annals of Mathematical Logic 3 (4):363.
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-6d9b7f7c4c-sqt28 uwo