Bases of admissible rules of the logics S4 and Int (Q1079559)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bases of admissible rules of the logics S4 and Int |
scientific article |
Statements
Bases of admissible rules of the logics S4 and Int (English)
0 references
1985
0 references
This paper uses results and notions of the author's paper reviewed above (Zbl 0598.03013) to prove for intuitionistic propositional calculus Int and for S4 that the set of admissible rules does not possess a finite basis. In fact even an infinite basis containing a finite set of variables is proved to be impossible.
0 references
modal logic
0 references
intuitionistic propositional calculus
0 references
admissible rules
0 references
finite basis
0 references
infinite basis
0 references
