Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/independent-bases-for-admissible-rules-in-pretable-logics-FAW30B2Lc1
References (8)
-
A. Chagrov, M. Zakharyaschev (1995)
On the independent axiomatizability of modal and superintuitionistic logicsJ. Log. Comp., 5
-
V. Rybakov (1992)
Rules of inference with parameters for intuitionistic logicJournal of Symbolic Logic, 57
-
V. Rybakov (1984)
A criterion for admissibility of rules in the model system S4 and the intuitionistic logicAlgebra and Logic, 23
-
V. V. Rybakov (1985)
Bases of admissible rules for the modal systemGrz and the intuitionistic logicMat. Sb., 128
-
V. Rybakov (1985)
Bases of admissible rules of the logics S4 and IntAlgebra and Logic, 24
-
V. Rybakov (1990)
Logical equations and admissible rules of inference with parameters in modal provability logicsStudia Logica, 49
-
A. Chagrov, M. Zakharyaschev (1995)
On the Independent Axiomatizability of Modal and Intermediate LogicsJ. Log. Comput., 5
-
V. Rybakov (1994)
Criteria for admissibility of inference rules. Modal and intermediate logics with the branching propertyStudia Logica, 53
- Publisher
- Springer Journals
- Copyright
- Copyright © 2000 by Kluwer Academic/Plenum Publsihers
- Subject
- Mathematics; Algebra; Mathematical Logic and Foundations
- ISSN
- 0002-5232
- eISSN
- 1573-8302
- DOI
- 10.1007/BF02681666
- Publisher site
- See Article on Publisher Site
Abstract
Independent bases of admissible inference rules are studied; namely, we treat inference rules in pretable modal logics over S4, and in pretable superintuitionistic logics. The Maksimova-Esakia-Meskhi theorem holds that there exist exactly five pretable S4-logics and precisely three pretable superintuitionistic ones. We argue that all pretable modal logics and all pretable super-intuitionistic logics have independent bases for admissible inference rules.
Journal
Algebra and Logic – Springer Journals
Published: Jul 21, 2007