Open Access
2001 Forcing Complexity: Minimum Sizes of Forcing Conditions
Toshio Suzuki
Notre Dame J. Formal Logic 42(2): 117-120 (2001). DOI: 10.1305/ndjfl/1054837938


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.


Download Citation

Toshio Suzuki. "Forcing Complexity: Minimum Sizes of Forcing Conditions." Notre Dame J. Formal Logic 42 (2) 117 - 120, 2001.


Published: 2001
First available in Project Euclid: 5 June 2003

zbMATH: 1060.03065
MathSciNet: MR1993395
Digital Object Identifier: 10.1305/ndjfl/1054837938

Primary: 68Q15
Secondary: 03D15

Keywords: computational complexity , t-generic oracle

Rights: Copyright © 2001 University of Notre Dame

Vol.42 • No. 2 • 2001
Back to Top