On Herbrand's theorem

DOI10.1007/3-540-60178-3_85OpenAlexW2113711982MaRDI QIDQ6064282

Samuel R. Buss

Publication date: 12 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60178-3_85

zbMATH Keywords

sequent calculusproof theorycompleteness theoremproof systemexistential quantifier

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Related Items (3)

On the Herbrand content of LK ⋮ Unnamed Item ⋮ Compressibility of Finite Languages by Grammars

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proof theory. 2nd ed
• Bounded arithmetic and the polynomial hierarchy
• Linear unification
• Relating the bounded arithmetic and polynomial time hierarchies
• False lemmas in Herbrand
• A Machine-Oriented Logic Based on the Resolution Principle
• Herbrand analyzing functions
• A supplement to Herbrand
• Notes on polynomially bounded arithmetic
• On the Interpretation of Non-Finitist Proofs--Part I
• On the interpretation of non-finitist proofs–Part II

This page was built for publication: On Herbrand's theorem