Bases of admissible rules of the logics S4 and Int
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.
scientific article; zbMATH DE number 3963792