Functional completeness for subsystems of intuitionistic propositional logic

DOI10.1007/BF01049305zbMath0776.03003MaRDI QIDQ1802397

Heinrich Wansing

Publication date: 19 August 1993

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

zbMATH Keywords

substructural logicsintuitionistic logicproof-theoretic semanticsadmissible connectiveshigher-level sequent calculusminimal propositional logicproof-theoretic proof of functional completeness

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items (4)

Logical connectives for constructive modal logic ⋮ Priest on Negation ⋮ Prawitz, Proofs, and Meaning ⋮ On Definability of Connectives and Modal Logics over FDE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Gentzenizing Schroeder-Heister's natural extension of natural deduction
• The semantics and proof theory of linear logic
• Sequent-systems and groupoid models. I
• The adequacy problem for inferential logic
• The Mathematics of Sentence Structure
• A natural extension of natural deduction
• Logics without the contraction rule
• Die Vollständigkeit des Operatorensystems {¬, ∨, ⊃} für die Intuitionistische Aussagenlogik im Rahmen der Gentzensematik
• Dialogspiele als Semantische Grundlage von Logikkalkülen
• Logical connectives for intuitionistic propositional logic

This page was built for publication: Functional completeness for subsystems of intuitionistic propositional logic