Non-elementary speed-ups in proof length by different variants of classical analytic calculi

DOI10.1007/BFb0027412zbMath1415.03057MaRDI QIDQ4610324

Uwe Egly

Publication date: 15 January 2019

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Complexity of proofs (03F20)

Cites Work

• On different structure-preserving translations to normal form
• Don't eliminate cut
• A curious inference
• A structure-preserving clause form translation
• An answer to an open problem of Urquhart
• Are tableaux an improvement on truth-tables? Cut-free proofs and bivalence
• Controlled integration of the cut rule into connection tableau calculi
• Untersuchungen über das logische Schliessen. I
• Lean induction principles for tableaux
• Automated Deduction with Shannon Graphs
• Proof theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item