Proof Nets for Herbrand’s Theorem

DOI10.1145/2422085.2422090zbMath1354.03085arXiv1005.3986OpenAlexW2143374829MaRDI QIDQ2946689

Richard McKinley

Publication date: 17 September 2015

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

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

zbMATH Keywords

cut eliminationproof netsclassical logicHerbrand's theorem

Mathematics Subject Classification ID

Classical first-order logic (03B10) Cut-elimination and normal-form theorems (03F05) Structure of proofs (03F07) Proof theory in general (including proof-theoretic semantics) (03F03)

Related Items (8)

On induction principles for partial orders ⋮ On the Herbrand content of LK ⋮ Proof Nets, Coends and the Yoneda Isomorphism ⋮ Classical proof forestry ⋮ Herbrand's theorem as higher order recursion ⋮ Unnamed Item ⋮ On new characterization of inextensible flows of space-like curves in de Sitter space ⋮ Expansion trees with cut

This page was built for publication: Proof Nets for Herbrand’s Theorem