Construction of an Explicit Basis for Rules Admissible in Modal System S4

Mathematical Logic Quarterly 47 (4):441-446 (2001)
  Copy   BIBTEX

Abstract

We find an explicit basis for all admissible rules of the modal logic S4. Our basis consists of an infinite sequence of rules which have compact and simple, readable form and depend on increasing set of variables. This gives a basis for all quasi-identities valid in the free modal algebra ℱS4 of countable rank

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 96,326

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Description of modal logics inheriting admissible rules for S4.V. Rybakov - 1999 - Logic Journal of the IGPL 7 (5):655-664.
Metalogic of Intuitionistic Propositional Calculus.Alex Citkin - 2010 - Notre Dame Journal of Formal Logic 51 (4):485-502.
On the rules of intermediate logics.Rosalie Iemhoff - 2006 - Archive for Mathematical Logic 45 (5):581-599.
Complexity of admissible rules.Emil Jeřábek - 2007 - Archive for Mathematical Logic 46 (2):73-92.
Canonical Rules.Emil Jeřábek - 2009 - Journal of Symbolic Logic 74 (4):1171 - 1205.

Analytics

Added to PP
2013-12-01

Downloads
32 (#567,882)

6 months
4 (#1,493,754)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Independent bases of admissible rules.Emil Jerábek - 2008 - Logic Journal of the IGPL 16 (3):249-267.
KD is nullary.Philippe Balbiani & Çiğdem Gencer - 2017 - Journal of Applied Non-Classical Logics 27 (3-4):196-205.
Linear temporal logic with until and next, logical consecutions.V. Rybakov - 2008 - Annals of Pure and Applied Logic 155 (1):32-45.

View all 9 citations / Add more citations

References found in this work

No references found.

Add more references