- 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
Forcing Complexity: Minimum Sizes of Forcing Conditions
Notre Dame Journal of Formal Logic 42 (2):117-120 (2001)
Abstract
This note is a continuation of our former paper ''Complexity of the r-query tautologies in the presence of a generic oracle.'' We give a very short direct proof of the nonexistence of t-generic oracles, a result obtained first by Dowd. We also reconstitute a proof of Dowd's result that the class of all r-generic oracles in his sense has Lebesgue measure oneLinks
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
Small forcing makes any cardinal superdestructible.Joel David Hamkins - 1998 - Journal of Symbolic Logic 63 (1):51-58.
Forcing many positive polarized partition relations between a cardinal and its powerset.Saharon Shelah & Lee J. Stanley - 2001 - Journal of Symbolic Logic 66 (3):1359-1370.
C. C. C. forcing without combinatorics.Alan H. Mekler - 1984 - Journal of Symbolic Logic 49 (3):830-832.
Forcing in łukasiewicz predicate logic.Antonio Di Nola, George Georgescu & Luca Spada - 2008 - Studia Logica 89 (1):111-145.
Proper forcing, cardinal arithmetic, and uncountable linear orders.Justin Tatch Moore - 2005 - Bulletin of Symbolic Logic 11 (1):51-60.
Projective Well-Orderings and Bounded Forcing Axioms.Andrés Eduardo Caicedo - 2005 - Journal of Symbolic Logic 70 (2):557 - 572.
Combinatorics on ideals and forcing with trees.Marcia J. Groszek - 1987 - Journal of Symbolic Logic 52 (3):582-593.
Souslin forcing.Jaime I. Ihoda & Saharon Shelah - 1988 - Journal of Symbolic Logic 53 (4):1188-1207.
The independence of δ1n.Amir Leshem & Menachem Magidor - 1999 - Journal of Symbolic Logic 64 (1):350 - 362.
Forcing and reducibilities. II. forcing in fragments of analysis.Piergiorgio Odifreddi - 1983 - Journal of Symbolic Logic 48 (3):724-743.
Forcing and reducibilities. III. forcing in fragments of set theory.Piergiorgio Odifreddi - 1983 - Journal of Symbolic Logic 48 (4):1013-1034.
Simple forcing notions and forcing axioms.Andrzej Rosłanowski & Saharon Shelah - 1997 - Journal of Symbolic Logic 62 (4):1297-1314.
Unfoldable cardinals and the GCH.Joel David Hamkins - 2001 - Journal of Symbolic Logic 66 (3):1186-1198.
Analytics
Added to PP
2010-08-24
Downloads
22 (#704,717)
6 months
7 (#419,303)
2010-08-24
Downloads
22 (#704,717)
6 months
7 (#419,303)
Historical graph of downloads
Citations of this work
Does truth-table of linear norm reduce the one-query tautologies to a random oracle?Masahiro Kumabe, Toshio Suzuki & Takeshi Yamazaki - 2008 - Archive for Mathematical Logic 47 (2):159-180.
Bounded truth table does not reduce the one-query tautologies to a random oracle.Toshio Suzuki - 2005 - Archive for Mathematical Logic 44 (6):751-762.
References found in this work
Complexity of the -query Tautologies in the Presence of a Generic Oracle.Toshio Suzuki - 2000 - Notre Dame Journal of Formal Logic 41 (2):142-151.
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-55b469568f-bzrbm uwo