We introduce a new propositional proof system, which we call H, that allows quantifi- cation over permutations. In H we may write (9ab) and (8ab) , ...

We introduce a new propositional proof system, which we call H, that allows quantification over permutations. In H we may write (∃ab)α and (∀ab)α, ...

Propositional proof complexity is a field of theoretical computer science which con- cerns itself with the lengths of formal proofs in various propositional ...

Sep 6, 2007 · Abstract. We introduce a new propositional proof system, which we call H, that allows quantification over permutations.

We introduce a new propositional proof system, which we call H, that allows quantification over permutations. In H we may write (∃ab)α and (∀ab)α, ...

Title: A Propositional Proof System with Permutation Quantifiers. Authors: Paterson, Tim. Advisor: Soltys, Michael. Department: Computing and Software.

Grzegorz Herman, Tim Paterson, Michael Soltys: A Propositional Proof System with Quantification Over Permutations. Fundam. Informaticae 79(1-2): 71-83 (2007).

We introduce a new propositional proof system, which we call H, that allows quantifi- cation over permutations. In H we may write (9ab) and (8ab) , ...

We introduce a novel propositional proof system, which we call Quantified. Permutation Frege (QPF). As the name suggests, QPF allows quantification over ...

LAP is LA with matrix powering; we show that LAP extended with quantification over permutations is strong enough to prove theorems such as the Cayley-Hamilton ...