scispace - formally typeset
Journal ArticleDOI

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

Vladimir V. Rybakov
- 01 Nov 2001 - 
- Vol. 47, Iss: 4, pp 441-446
TLDR
In this article, an explicit basis for all admissible rules of the modal logic S4 is given, consisting of an infinite sequence of rules which have compact and simple, readable form and depend on increasing set of variables.
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.

read more

Citations
More filters
Journal ArticleDOI

Logical consecutions in discrete linear temporal logic

TL;DR: It is proved that both logics LDTL and L(N) are decidable w.r.t. inference rules, and as a consequence, they both areDecidable (known fact), and the given deciding algorithms are explicit.
Journal ArticleDOI

Unification in modal and description logics

TL;DR: A survey of the results on unification obtained in two closely related, yet different, application areas of unification: description logics and modal logics is given.
Journal ArticleDOI

Linear temporal logic with until and next, logical consecutions

TL;DR: This paper considers logical consequence in the standard with temporal operations (until) and (next), and proves that is decidable w.r.t. admissible inference rules.
Journal ArticleDOI

Linear Temporal Logic LTL

TL;DR: The current article aims to provide an explicit (infinite) basis for rules admissible in LTL with operations Until and Next and to suggest a recursive infinite basis for admissible rules.
Journal ArticleDOI

Independent Bases of Admissible Rules

TL;DR: It is shown that IPC, K4, GL, and S4, as well as all logics inheriting their admissible rules, have independent bases of admissible Rules.