In this paper we define the notion of frame based formulas. We show that the well-known examples of formulas arising from a finite frame, such as the Jankov-de Jongh formulas, subframe formulas and cofinal subframe formulas, are all particular cases of the frame based formulas. We give a criterion for an intermediate logic to be axiomatizable by frame based formulas and use this criterion to obtain a simple proof that every locally tabular intermediate logic is axiomatizable by Jankov-de Jongh formulas. (...) We also show that not every intermediate logic is axiomatizable by frame based formulas. (shrink)

We define the concepts of minimal p-morphic image and basic p-morphism for transitive Kripke frames. These concepts are used to determine effectively the least number of variables necessary to axiomatize a tabular extension of K4, and to describe the covers and co-covers of such a logic in the lattice of the extensions of K4.

Prioritized bases, i.e., weakly ordered sets of sentences, have been used for specifying an agent’s ‘basic’ or ‘explicit’ beliefs, or alternatively for compactly encoding an agent’s belief state without the claim that the elements of a base are in any sense basic. This paper focuses on the second interpretation and shows how a shifting of priorities in prioritized bases can be used for a simple, constructive and intuitive way of representing a large variety of methods for the change of belief (...) states—methods that have usually been characterized semantically by a system-of-spheres modeling. Among the methods represented are ‘radical’, ‘conservative’ and ‘moderate’ revision, ‘revision by comparison’ in its raising and lowering variants, as well as various constructions for belief expansion and contraction. Importantly, none of these methods makes any use of numbers. (shrink)

This paper investigates the structure of lattices of normal mono- and polymodal subframelogics, i.e., those modal logics whose frames are closed under a certain type of substructures. Nearly all basic modal logics belong to this class. The main lattice theoretic tool applied is the notion of a splitting of a complete lattice which turns out to be connected with the “geometry” and “topology” of frames, with Kripke completeness and with axiomatization problems. We investigate in detail subframe logics containing K4, those (...) containing polymodal Altn and subframe logics which are tense logics. (shrink)

Operators which map subsets of a given set to the set of their minimal elements with respect to some relation R form the basis of a semanticapproach in non-monotonic logic, belief revision, conditional logic and updating. In this paper we investigate operators of this type from an algebraicviewpoint. A representation theorem is proved and various properties of theresulting algebras are investigated. It is shown that they behave quite differently from known algebras related to logics, e.g. modal algebras and Heytingalgebras.

This paper investigates partitions of lattices of modal logics based on superintuitionistic logics which are defined by forming, for each superintuitionistic logic L and classical modal logic , the set L[] of L-companions of . Here L[] consists of those modal logics whose non-modal fragments coincide with L and which axiomatize if the law of excluded middle p V p is added. Questions addressed are, for instance, whether there exist logics with the disjunction property in L[], whether L[] contains a (...) smallest element, and whether L[] contains lower covers of . Positive solutions as concerns the last question show that there are (uncountably many) superclean modal logics based on intuitionistic logic in the sense of Vakarelov [28]. Thus a number of problems stated in [28] are solved. As a technical tool the paper develops the splitting technique for lattices of modal logics based on superintuitionistic logics and ap plies duality theory from [34]. (shrink)

It is shown that the normal modal logic of two reflexive points jointed with a symmetric binary relation splits the lattice of normal extensions of the logic KTB. By this fact, it is easily seen that there exists the third largest logic in the class of all normal extensions of KTB.

It is shown that the normal modal logic of two reflexive points jointed with a symmetric binary relation splits the lattice of normal extensions of the logic KTB. By this fact, it is easily seen that there exists the third largest logic in the class of all normal extensions of KTB.

An old conjecture of modal logics states that every splitting of the major systems K4, S4, G and Grz has the finite model property. In this paper we will prove that all iterated splittings of G have fmp, whereas in the other cases we will give explicit counterexamples. We also introduce a proof technique which will give a positive answer for large classes of splitting frames. The proof works by establishing a rather strong property of these splitting frames namely that (...) they preserve the finite model property in the following sense. Whenever an extension Λ has fmp so does the splitting Λ/f of Λ by f. Although we will also see that this method has its limitations because there are frames lacking this property, it has several desirable side effects. For example, properties such as compactness, decidability and others can be shown to be preserved in a similar way and effective bounds for the size of models can be given. Moreover, all methods and proofs are constructive. (shrink)

A logic Λ bounds a property P if all proper extensions of Λ have P while Λ itself does not. We construct logics bounding finite axiomatizability and logics bounding finite model property in the lattice of intermediate logics and in the lattice of normal extensions of K4.3. MSC: 03B45, 03B55.

The present paper is based on [11], where a number of conjectures are made concerning the structure of the lattice of normal extensions of the tense logicKt. That paper was mainly dealing with splittings of and some sublattices, and this is what I will concentrate on here as well. The main tool in analysing the splittings of will be the splitting theorem of [8]. In [11] it was conjectured that each finite subdirectly irreducible algebra splits the lattice of normal extensions (...) ofK4t andS4t. We will show that this is not the case and that on the contrary only very few and trivial splittings of the mentioned lattices exist. (shrink)

In this paper we show that a variety of modal algebras of finite type is semisimple iff it is discriminator iff it is both weakly transitive and cyclic. This fact has been claimed already in [4] (based on joint work by the two authors) but the proof was fatally flawed.

We develop canonical rules capable of axiomatizing all systems of multiple-conclusion rules over K4 or IPC, by extension of the method of canonical formulas by Zakharyaschev [37]. We use the framework to give an alternative proof of the known analysis of admissible rules in basic transitive logics, which additionally yields the following dichotomy: any canonical rule is either admissible in the logic, or it is equivalent to an assumption-free rule. Other applications of canonical rules include a generalization of the Blok–Esakia (...) theorem and the theory of modal companions to systems of multiple-conclusion rules or (finitary structural global) consequence relations, and a characterization of splittings in the lattices of consequence relations over monomodal or superintuitionistic logics with the finite model property. (shrink)