Quantified propositional calculi and fragments of bounded arithmetic

Recommendations

Examining Fragments of the Quantified Propositional Calculus
On the provability logic of bounded arithmetic
scientific article; zbMATH DE number 819737
scientific article; zbMATH DE number 4010488
Propositional quantification in the monadic fragment of intuitionistic logic
Fragments of bounded arithmetic and the lengths of proofs
scientific article; zbMATH DE number 4099258
Computations in fragments of intuitionistic propositional logic
scientific article; zbMATH DE number 2015268
Predicate logics of decidable fragments of arithmetic

Cited in

(36)

Computations in fragments of intuitionistic propositional logic
Towards a unified complexity theory of total functions
Quantified propositional calculus and a second-order theory for NC\(^{\text \textbf{1}}\)
Fragments of bounded arithmetic and the lengths of proofs
Simulating non-prenex cuts in quantified propositional calculus
Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic
Classes of representable disjoint \textsf{NP}-pairs
Tuples of disjoint \(\mathsf{NP}\)-sets
Towards Uniform Certification in QBF
Polynomial local search in the polynomial hierarchy and witnessing in fragments of bounded arithmetic
Examining Fragments of the Quantified Propositional Calculus
Preservation theorems and restricted consistency statements in bounded arithmetic
Witnessing functions in bounded arithmetic and search problems
Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 12--17, 2023
Proof complexity and beyond. Abstracts from the workshop held March 24--29, 2024
Expansion-based QBF solving versus Q-resolution
Some consequences of cryptographical conjectures for \(S_2^1\) and EF
On the finite axiomatizability of \(\forall\hat{\Sigma}^{\mathrm{b}}_1 (\hat{\mathsf{R}}^1_2)\)
On induction-free provability
Circuit principles and weak pigeonhole variants
Tautologies from pseudo-random generators
Lifting lower bounds for tree-like proofs
Separation results for the size of constant-depth propositional proofs
scientific article; zbMATH DE number 3900723 (Why is no real title available?)
Slicewise Definability in First-Order Logic with Bounded Quantifier Rank.
On the correspondence between arithmetic theories and propositional proof systems – a survey
Bounded arithmetic and the polynomial hierarchy
Witnessing flows in arithmetic
Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem
Tractable fragments of Presburger arithmetic
Implicit proofs
Logical Closure Properties of Propositional Proof Systems
Dual weak pigeonhole principle, Boolean complexity, and derandomization
On transformations of constant depth propositional proofs
Induction rules in bounded arithmetic
On an optimal quantified propositional proof system nal proof system and a complete language for NP ∩ co-NP for NP ∩ co-NP

This page was built for publication: Quantified propositional calculi and fragments of bounded arithmetic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3472099)