Towards Algorithmic Cut-Introduction
From MaRDI portal
Publication:2891453
DOI10.1007/978-3-642-28717-6_19zbMath1352.68213OpenAlexW14789509MaRDI QIDQ2891453
Daniel Weller, Alexander Leitsch, Stefan Hetzl
Publication date: 15 June 2012
Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-28717-6_19
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (14)
Proof mining with dependent types ⋮ Contextual Natural Deduction ⋮ Implementation and Evaluation of Contextual Natural Deduction for Minimal Logic ⋮ On the Herbrand content of LK ⋮ On the generation of quantified lemmas ⋮ Algorithmic introduction of quantified cuts ⋮ On the compressibility of finite languages and formal proofs ⋮ Unnamed Item ⋮ Herbrand's theorem as higher order recursion ⋮ Analogy in Automated Deduction: A Survey ⋮ System Description: GAPT 2.0 ⋮ Compressibility of Finite Languages by Grammars ⋮ On the cover complexity of finite languages ⋮ Inductive theorem proving based on tree grammars
This page was built for publication: Towards Algorithmic Cut-Introduction
