Schematic Cut Elimination and the Ordered Pigeonhole Principle

DOI10.1007/978-3-319-40229-1_17zbMath1476.03079arXiv1601.06548OpenAlexW3046430348MaRDI QIDQ2817924

Alexander Leitsch, David M. Cerna

Publication date: 5 September 2016

Published in: Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1601.06548

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Proof theory in general (including proof-theoretic semantics) (03F03)

Related Items (2)

Schematic refutations of formula schemata ⋮ Schematic Cut Elimination and the Ordered Pigeonhole Principle

Uses Software

• SPASS
• CERES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Methods of cut-elimination
• CERES: An analysis of Fürstenberg's proof of the infinity of primes
• Cut-elimination for a logic with definitions and induction
• Schematic Cut Elimination and the Ordered Pigeonhole Principle
• Sequent calculi for induction and infinite descent
• Cut-Elimination and Proof Schemata
• Automated Reasoning with Analytic Tableaux and Related Methods
• Proof theory
• Cut-elimination and redundancy-elimination by resolution

This page was built for publication: Schematic Cut Elimination and the Ordered Pigeonhole Principle