Cut-Elimination and Proof Schemata

DOI10.1007/978-3-662-46906-4_8zbMath1326.03069OpenAlexW2188917269MaRDI QIDQ3455184

Daniel Weller, Alexander Leitsch, Cvetan Dunchev, Mikheil Rukhaia

Publication date: 3 December 2015

Published in: Logic, Language, and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-46906-4_8

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05)

Related Items (5)

Ceres in intuitionistic logic ⋮ Cut-Elimination and Proof Schemata ⋮ A deductive approach towards reasoning about algebraic transition systems ⋮ Schematic refutations of formula schemata ⋮ Schematic Cut Elimination and the Ordered Pigeonhole Principle

Cites Work

• Unnamed Item
• CERES: An analysis of Fürstenberg's proof of the infinity of primes
• Proof theory. 2nd ed
• Cut-elimination for a logic with definitions and induction
• Towards a clausal analysis of cut-elimination
• A Resolution Calculus for First-order Schemata
• Decidability and Undecidability Results for Propositional Schemata
• Sequent calculi for induction and infinite descent
• Cut-Elimination and Proof Schemata
• A Schemata Calculus for Propositional Logic
• Towards an algorithmic construction of cut-elimination procedures
• Automated Reasoning with Analytic Tableaux and Related Methods
• Logic for Programming, Artificial Intelligence, and Reasoning
• Cut-elimination and redundancy-elimination by resolution

This page was built for publication: Cut-Elimination and Proof Schemata