A propositional proof system with quantification over permutations

MaRDI QIDQ5422267zbMATH OpenFDO

Authors Grzegorz Herman, Tim Paterson, Michael Soltys

Publication date 17 October 2007

zbMATH Keywords

extended FregeHajós calculuspermutation quantifierpropositional proof system

Mathematics Subject Classification ID

Complexity of proofs (03F20)

Recommendations

• Tractability of cut-free Gentzen-type propositional calculus with permutation inference. II
• scientific article; zbMATH DE number 1507229
• Tractability of cut-free Gentzen type propositional calculus with permutation inference
• Automata, Languages and Programming
• Propositional proofs in Frege and extended Frege systems (abstract)

Cited in

(2)

• Tractability of cut-free Gentzen-type propositional calculus with permutation inference. II
• Automata, Languages and Programming

This page was built for publication: A propositional proof system with quantification over permutations

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