Examining Fragments of the Quantified Propositional Calculus
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 819737 (Why is no real title available?)
- Bounded arithmetic and the polynomial hierarchy
- Lower bounds to the size of constant-depth propositional proofs
- NP search problems in low fragments of bounded arithmetic
- On induction-free provability
- Quantified propositional calculi and fragments of bounded arithmetic
- Quantified propositional calculus and a second-order theory for NC\(^{\text \textbf{1}}\)
- The strength of replacement in weak arithmetic
Cited in
(6)- Herbrand's theorem as higher order recursion
- Quantified propositional calculus and a second-order theory for NC\(^{\text \textbf{1}}\)
- Simulating non-prenex cuts in quantified propositional calculus
- Quantified propositional calculi and fragments of bounded arithmetic
- Computer Science Logic
- scientific article; zbMATH DE number 4202241 (Why is no real title available?)
This page was built for publication: Examining Fragments of the Quantified Propositional Calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3617380)
