Functional completeness for subsystems of intuitionistic propositional logic (Q1802397)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 203333
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Functional completeness for subsystems of intuitionistic propositional logic |
scientific article; zbMATH DE number 203333 |
Statements
Functional completeness for subsystems of intuitionistic propositional logic (English)
0 references
19 August 1993
0 references
In this paper a proof-theoretic proof of functional completeness is presented for a broad variety of substructural subsystems of intuitionistic and minimal propositional logic. The space of admissible connectives is described by rule schemata in a higher-level sequent calculus framework.
0 references
substructural logics
0 references
proof-theoretic semantics
0 references
intuitionistic logic
0 references
proof-theoretic proof of functional completeness
0 references
minimal propositional logic
0 references
admissible connectives
0 references
higher-level sequent calculus
0 references
0.7965022921562195
0 references
0.7903212904930115
0 references
