Fragments of bounded arithmetic and bounded query classes
Open Access
- 1 January 1993
- journal article
- Published by American Mathematical Society (AMS) in Transactions of the American Mathematical Society
- Vol. 338 (2) , 587-598
- https://doi.org/10.1090/s0002-9947-1993-1124169-x
Abstract
We characterize functions and predicates Σ i + 1 b \Sigma _{i + 1}^b -definable in S 2 i S_2^i . In particular, predicates Σ i + 1 b \Sigma _{i + 1}^b -definable in S 2 i S_2^i are precisely those in bounded query class P Σ i p [ O ( log n ) ] {P^{\Sigma _i^p}}[O(\log n)] (which equals to Log Space Σ i p \operatorname {Log}\;{\text {Space}}^{\Sigma _i^p} by [B-H, W]). This implies that S 2 i ≠ T 2 i S_2^i \ne T_2^i unless P Σ i p [ O ( log n ) ] = Δ i + 1 p {P^{\Sigma _i^p}}[O(\log n)] = \Delta _{i + 1}^p . Further we construct oracle A A such that for all i ≥ 1 i \geq 1 ...Keywords
This publication has 13 references indexed in Scilit:
- Interactive computations of optimal solutionsPublished by Springer Nature ,2005
- On induction-free provabilityAnnals of Mathematics and Artificial Intelligence, 1992
- Some Relations Between Subsystems of Arithmetic and Complexity of ComputationsPublished by Springer Nature ,1992
- No Counter-Example Interpretation and Interactive ComputationPublished by Springer Nature ,1992
- Bounded arithmetic and the polynomial hierarchyAnnals of Pure and Applied Logic, 1991
- Bounded Query ClassesSIAM Journal on Computing, 1990
- Axiomatizations and conservation results for fragments of bounded arithmeticPublished by American Mathematical Society (AMS) ,1990
- Quantified propositional calculi and fragments of bounded arithmeticMathematical Logic Quarterly, 1990
- The complexity of optimization problemsPublished by Association for Computing Machinery (ACM) ,1986
- Existence and feasibility in arithmeticThe Journal of Symbolic Logic, 1971