Ultimate Normal Forms for Parallelized Natural Deductions

DOI10.1093/jigpal/10.3.299zbMath1010.03048OpenAlexW1971210176MaRDI QIDQ3147433

Neil Tennant

Publication date: 18 September 2002

Published in: Logic Journal of IGPL (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/08496ca396c40e1413c5454738df46a9cce74f79

zbMATH Keywords

normal formssequent calculusnatural deductioncut-eliminationreduction procedurenormalization theoremdeductive relevanceintuitionistic relevant logicHauptsatzparallelized elimination rules

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47)

Related Items (6)

Analytic rules for mereology ⋮ Core Type Theory ⋮ Proof Terms for Generalized Natural Deduction ⋮ The calculus of higher-level rules, propositional quantification, and the foundational approach to proof-theoretic harmony ⋮ Generalized Elimination Inferences, Higher-Level Rules, and the Implications-as-Rules Interpretation of the Sequent Calculus ⋮ ON THE NOTION OF CANONICAL DERIVATIONS FROM OPEN ASSUMPTIONS AND ITS ROLE IN PROOF-THEORETIC SEMANTICS

Uses Software

• Pesca

This page was built for publication: Ultimate Normal Forms for Parallelized Natural Deductions