Bases of admissible rules of the logics S4 and Int
type: Item
instance of: scholarly article
title: Bases of admissible rules of the logics S4 and Int
zbMATH Open document ID: 0598.03014
DOI: 10.1007/BF01978706
published in: Algebra and Logic
publication date: 1985-01-01T00:00:00Z
full work available at URL: https://eudml.org/doc/187304
review text: 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.
Mathematics Subject Classification ID: 03B45
Mathematics Subject Classification ID: 03F50
Mathematics Subject Classification ID: 03B25
Mathematics Subject Classification ID: 03B55
Mathematics Subject Classification ID: 03B60
Mathematics Subject Classification ID: 03G25
zbMATH DE Number: 3963792
zbMATH Keywords: modal logic
zbMATH Keywords: intuitionistic propositional calculus
zbMATH Keywords: admissible rules
zbMATH Keywords: finite basis
zbMATH Keywords: infinite basis
author: Vladimir Rybakov
reviewed by: G. E. Mints
MaRDI profile type: Publication
cites work: Q3950540
cites work: Decidability of the admissibility problem in layer-finite logics
cites work: ON ADMISSIBLE RULES OF INTUITIONISTIC PROPOSITIONAL LOGIC
cites work: Modal Logics Between S 4 and S 5
cites work: One hundred and two problems in mathematical logic
cites work: Completeness of calculii for axiomatically defined classes of algebras
description: scientific article; zbMATH DE number 3963792