Notre Dame Journal of Formal Logic
- Notre Dame J. Formal Logic
- Volume 42, Number 2 (2001), 117-120.
Forcing Complexity: Minimum Sizes of Forcing Conditions
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 one.
Notre Dame J. Formal Logic Volume 42, Number 2 (2001), 117-120.
First available in Project Euclid: 5 June 2003
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Primary: 68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.) [See also 03D15, 68Q17, 68Q19]
Secondary: 03D15: Complexity of computation (including implicit computational complexity) [See also 68Q15, 68Q17]
Suzuki, Toshio. Forcing Complexity: Minimum Sizes of Forcing Conditions. Notre Dame J. Formal Logic 42 (2001), no. 2, 117--120. doi:10.1305/ndjfl/1054837938. https://projecteuclid.org/euclid.ndjfl/1054837938