Archive for Mathematical Logic

, Volume 44, Issue 6, pp 751–762 | Cite as

Bounded truth table does not reduce the one-query tautologies to a random oracle

  • Toshio Suzuki


The relativized propositional calculus is a system of Boolean formulas with query symbols. A formula in this system is called a one-query formula if the number of occurrences of query symbols is just one. If a one-query formula is a tautology with respect to a given oracle A then it is called a one-query tautology with respect to A. By extending works of Ambos-Spies (1986) and us (2002), we investigate the measure of the class of all oracles A such that the set of all one-query tautologies with respect to A does not p-btt-reduce to A, where p-btt denotes polynomial-time bounded-truth-table. We show that certain Dowd-type generic oracles all belong to the class, and hence measure of the class is one.

Keywords or phrases

Dowd-type generic oracle Measure One-query tautology Random oracle The relativized propositional calculus Truth table reduction 

Mathematics Subject Classification (2000)

68Q15 03D15 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Ambos-Spies, K.: Randomness, relativizations, and polynomial reducibilities. In: Structure in Complexity Theory, A.L. Selman (eds.), Lect. Notes Comput. Sci. 223, 23–34, Springer, Berlin, (1986)Google Scholar
  2. 2.
    Ambos-Spies, K.: Resource-bounded genericity. In: Computability, enumerability, unsolvability, S.B. Cooper, T.A. Slaman, S.S. Wainer (eds.), London Math. Soc. Lect. Note Series 224, Cambridge University Press, Cambridge, 1996, pp. 1–59Google Scholar
  3. 3.
    Ambos-Spies, K., Fleischhack, H., Huwig, H.: Diagonalizations over polynomial time computable sets. Theoret. Comput. Sci. 51, 177–204 (1987)CrossRefGoogle Scholar
  4. 4.
    Ambos-Spies, K., Mayordomo, E.: Resource-bounded measure and randomness. In: Complexity, logic, and recursion theory, A. Sorbi (eds.), Lecture Notes in Pure and Applied Mathematics 187, Marcel Dekker, New York, 1997, pp. 1–47Google Scholar
  5. 5.
    Ambos-Spies, K., Neis, H., Terwijin, S.A.: Genericity and measure for exponential time. Theoret. Comput. Sci. 168, 3–19 (1996)CrossRefGoogle Scholar
  6. 6.
    Balcázar, J.L., Díaz, J., Gabarró, J.: Structural complexity I. Springer, Berlin, 1988Google Scholar
  7. 7.
    Bennett, C.H., Gill, J.: Relative to a random oracle A, PA ≠ NPA ≠ co-NPA with probability 1. SIAM J. Comput. 10, 96–113 (1981)CrossRefGoogle Scholar
  8. 8.
    Book, R.V., Tang S.: Polynomial-time reducibilities and “almost all” oracle sets. Theoret. Comput. Sci. 81, 35–47 (1991)CrossRefGoogle Scholar
  9. 9.
    Dowd, M.: Generic oracles, uniform machines, and codes. Information and Computation 96, pp. 65–76 (1992)Google Scholar
  10. 10.
    Ko, Ker-I.: Some observations on the probabilistic algorithms and NP-hard problems. Inform. Process. Lett. 14, 39–43 (1982)CrossRefGoogle Scholar
  11. 11.
    Kurtz, S.A.: On the random oracle hypothesis. Inform. Control 57, 40–47 (1983), Preliminary version appeared in: Proc. 14th. ann. ACM symp. on theory of computing, Association for Computing Machinery, 1982, pp. 224–230CrossRefGoogle Scholar
  12. 12.
    Ladner, R.E., Lynch, N.A., Selman, A.L.: A comparison of polynomial time reducibilities. Theoret. Comput. Sci. 1, 103–123 (1975)CrossRefGoogle Scholar
  13. 13.
    Merkle, W., Wang, Y.: Separations by random oracles and “almost” classes for generalized reducibilities. Math. Logic Quart. 47, 249–269 (2001)CrossRefGoogle Scholar
  14. 14.
    Orponen, P.: Complexity classes of alternating machines with oracles. In: Automata, languages and programming 10th colloquium, J. Diaz (eds.), Lect. Notes Comput. Sci. 154 Springer, Berlin, 1983, pp. 573–584Google Scholar
  15. 15.
    Rogers, H. Jr.: Theory of recursive functions and effective computability. Massachusetts Institute of Technology, 1987 (Original edition: MacGraw-Hill, New York, 1967)Google Scholar
  16. 16.
    Sacks, G.E.: Degrees of unsolvability. Ann. Math. Studies 55. Princeton university press, Princeton, N.J., 1963Google Scholar
  17. 17.
    Spector, C: Measure theoretic construction of incomparable hyperdegrees. J. Symbolic Logic 23, 280–288 (1958)Google Scholar
  18. 18.
    Suzuki, T.: Recognizing tautology by a deterministic algorithm whose while-loop’s execution time is bounded by forcing. Kobe Journal of Mathematics 15, 91–102 (1998)Google Scholar
  19. 19.
    Suzuki, T.: Computational complexity of Boolean formulas with query symbols. Doctoral dissertation, 1999, Institute of Mathematics, University of Tsukuba, Tsukuba-City, JapanGoogle Scholar
  20. 20.
    Suzuki, T.: Complexity of the r-query tautologies in the presence of a generic oracle. Notre Dame J. Formal Logic 41, 142–151 (2000)CrossRefGoogle Scholar
  21. 21.
    Suzuki, T.: Forcing complexity: minimum sizes of forcing conditions. Notre Dame J. Formal Logic 42, 117–120 (2001)CrossRefGoogle Scholar
  22. 22.
    Suzuki, T.: Degrees of Dowd-type generic oracles. Inform. and Comput. 176, 66–87 (2002)CrossRefGoogle Scholar
  23. 23.
    Suzuki, T.: Forcing complexity: degree of randomness shown by minimum sizes of forcing conditions. A talk at Takeuti Symposium (2003), Kobe, JapanGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  1. 1.Department of Mathematics and Information SciencesOsaka Prefecture UniversitySakaiJapan

Personalised recommendations