Fragments of Bounded Arithmetic and Bounded Query Classes
DOI10.2307/2154418zbMATH Open0787.03047OpenAlexW4242801681WikidataQ106785033 ScholiaQ106785033MaRDI QIDQ3137488FDOQ3137488
Authors: Jan Krajíček 
Publication date: 23 May 1994
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2154418
Recommendations
Cut-elimination and normal-form theorems (03F05) First-order arithmetic and fragments (03F30) Metamathematics of constructive systems (03F50) Complexity of computation (including implicit computational complexity) (03D15)
Cited In (15)
- Quantified propositional calculus and a second-order theory for NC\(^{\text \textbf{1}}\)
- Computer Science Logic
- Bounded query classes and the difference hierarchy
- An Application of Boolean Complexity to Separation Problems in Bounded Arithmetic
- A Characterisation of Definable NP Search Problems in Peano Arithmetic
- Bounded theories for polyspace computability
- Some consequences of cryptographical conjectures for S 2 1 and EF
- On parallel hierarchies and R ki
- Some consequences of cryptographical conjectures for \(S_2^1\) and EF
- Relating the bounded arithmetic and polynomial time hierarchies
- On the computational complexity of cut-reduction
- Title not available (Why is that?)
- Title not available (Why is that?)
- Induction rules in bounded arithmetic
- On parallel hierarchies and \(R_k^i\)
This page was built for publication: Fragments of Bounded Arithmetic and Bounded Query Classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3137488)
