scientific article; zbMATH DE number 1114027

MaRDI QIDQ4375798zbMATH OpenFDO

Authors Chris Pollett

Publication date 24 June 1998

zbMATH Keywords

bounded arithmeticGentzen-style quantified propositional proof systemsquantified propositional logic

Mathematics Subject Classification ID

Classical propositional logic (03B05) Complexity of proofs (03F20) First-order arithmetic and fragments (03F30)

Recommendations

• Quantified propositional calculi and fragments of bounded arithmetic
• Examining Fragments of the Quantified Propositional Calculus
• Implicit proofs
• Computer Science Logic

Cited in

(3)

• Examining Fragments of the Quantified Propositional Calculus
• Computer Science Logic
• Relational and Kleene-Algebraic Methods in Computer Science

This page was built for publication:

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