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

Archive for Mathematical Logic 44 (6):751-762 (2005)
  Copy   BIBTEX

Abstract

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

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,793

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

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.
Forcing Complexity: Minimum Sizes of Forcing Conditions.Toshio Suzuki - 2001 - Notre Dame Journal of Formal Logic 42 (2):117-120.
Learning via queries and oracles.Frank Stephan - 1998 - Annals of Pure and Applied Logic 94 (1-3):273-296.
Effective Search Problems.Martin Kummer & Frank Stephan - 1994 - Mathematical Logic Quarterly 40 (2):224-236.
Intrinsic Reducibilities.Timothy H. McNicholl - 2000 - Mathematical Logic Quarterly 46 (3):393-407.
Arithmetical Measure.Sebastiaan A. Terwijn & Leen Torenvliet - 1998 - Mathematical Logic Quarterly 44 (2):277-286.
Querying linguistic treebanks with monadic second-order logic in linear time.Stephan Kepser - 2004 - Journal of Logic, Language and Information 13 (4):457-470.
Paraconsistent logic and query answering in inconsistent databases.C. A. Middelburg - 2024 - Journal of Applied Non-Classical Logics 34 (1):133-154.

Analytics

Added to PP
2013-11-23

Downloads
26 (#835,533)

6 months
6 (#812,813)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Measure-theoretic construction of incomparable hyperdegrees.Clifford Spector - 1958 - Journal of Symbolic Logic 23 (3):280-288.
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.
Forcing Complexity: Minimum Sizes of Forcing Conditions.Toshio Suzuki - 2001 - Notre Dame Journal of Formal Logic 42 (2):117-120.

Add more references