Natural deduction via graphs: formal definition and computation rules
From MaRDI portal
Publication:5308097
DOI10.1017/S0960129507006123zbMath1159.03040MaRDI QIDQ5308097
Publication date: 26 September 2007
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
cut eliminationnatural deductionlambda calculusnormalisationdeduction graphsFitch-style flag deductiongeneralised graphslet expressions
Logic in computer science (03B70) Cut-elimination and normal-form theorems (03F05) Classical propositional logic (03B05) Structure of proofs (03F07) Combinatory logic and lambda calculus (03B40)
Related Items (5)
On a graph calculus for modalities ⋮ On graph calculi for multi-modal logics ⋮ Translations between Gentzen-Prawitz and Jaśkowski-Fitch natural deduction proofs ⋮ The Role of Structural Reasoning in the Genesis of Graph Theory ⋮ Deduction Graphs with Universal Quantification
This page was built for publication: Natural deduction via graphs: formal definition and computation rules