scientific article; zbMATH DE number 1114027

zbMATH Open0890.03033MaRDI QIDQ4375798FDOQ4375798

Authors: Chris Pollett 

Publication date: 24 June 1998

Title of this publication is not available (Why is that?)

Recommendations

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

zbMATH Keywords

bounded arithmeticquantified propositional logicGentzen-style quantified propositional proof systems

Mathematics Subject Classification ID

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

Cited In (3)

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

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)