On the proof theory of the intermediate logic MH

DOI10.2307/2274019zbMath0639.03022OpenAlexW2085516474MaRDI QIDQ3781073

Jonathan P. Seldin

Publication date: 1986

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

Full work available at URL: https://doi.org/10.2307/2274019

zbMATH Keywords

proof theorynatural deduction systemnormal form theoremGlivenko's theoremCraig-Lyndon interpolation theoremintermediate logic MH

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Intermediate logics (03B55)

Related Items

Postponement of $\mathsf {raa}$ and Glivenko's theorem, revisited, Normalization theorems for full first order classical natural deduction, Henkin’s Completeness Proof and Glivenko’s Theorem, 2000 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium 2000, A short proof of the strong normalization of classical natural deduction with disjunction, SUBFORMULA AND SEPARATION PROPERTIES IN NATURAL DEDUCTION VIA SMALL KRIPKE MODELS, Peirce's Rule in a Full Natural Deduction System, A new normalization strategy for the implicational fragment of classical propositional logic, Normalization and excluded middle. I, 2008 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '08, Prawitz, Proofs, and Meaning, On Constructive Fragments of Classical Logic, Intrinsic reasoning about functional programs. II: Unipolar induction and primitive-recursion, On the Structure of Natural Deduction Derivations for “Generally”

Cites Work

• Unnamed Item
• Applications of trees to intermediate logics