Introducing Quantified Cuts in Logic with Equality

DOI10.1007/978-3-319-08587-6_17zbMath1423.68418arXiv1402.2474OpenAlexW1659517711MaRDI QIDQ3192194

Giselle Reis, Alexander Leitsch, Janos Tapolczai, Stefan Hetzl, Daniel Weller

Publication date: 26 September 2014

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

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

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Proof theory in general (including proof-theoretic semantics) (03F03)

Related Items (10)

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 ⋮ 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: Introducing Quantified Cuts in Logic with Equality