Functional completeness for subsystems of intuitionistic propositional logic
From MaRDI portal
Publication:1802397
DOI10.1007/BF01049305zbMath0776.03003MaRDI QIDQ1802397
Publication date: 19 August 1993
Published in: Journal of Philosophical Logic (Search for Journal in Brave)
substructural logics; intuitionistic logic; proof-theoretic semantics; admissible connectives; higher-level sequent calculus; minimal propositional logic; proof-theoretic proof of functional completeness
03F05: Cut-elimination and normal-form theorems
03B20: Subsystems of classical logic (including intuitionistic logic)
Related Items
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