This paper is a survey of results concerning embeddings of intuitionistic propositional logic and its extensions into various classical modal systems.

We study modal logics in the setting of varieties of modal algebras. Any variety of modal algebras generated by a finite algebra — such, a variety is called tabular — has only finitely many subvarieties, i.e. is of finite height. The converse does not hold in general. It is shown that the converse does hold in the lattice of varieties of K4-algebras. Hence the lower part of this lattice consists of tabular varieties only. We proceed to show that there is (...) a continuum of pretabular varieties of K4-algebras — those are the non-tabular varieties all of whose proper subvarieties are tabular — in contrast with Maksimova's result that there are only five pretabular varieties of S4-algebras. (shrink)

Modal logics are studied in their algebraic disguise of varieties of so-called modal algebras. This enables us to apply strong results of a universal algebraic nature, notably those obtained by B. Jonsson. It is shown that the degree of incompleteness with respect to Kripke semantics of any modal logic containing the axiom □ p → p or containing an axiom of the form $\square^mp \leftrightarrow\square^{m + 1}p$ for some natural number m is 2 ℵ 0 . Furthermore, we show that (...) there exists an immediate predecessor of classical logic (axiomatized by $p \leftrightarrow \square p$ ) which is not characterized by any finite algebra. The existence of modal logics having 2 ℵ 0 immediate predecessors is established. In contrast with these results we prove that the lattice of extensions of S4 behaves much better: a logic extending S4 is characterized by a finite algebra iff it has finitely many extensions and any such logic has only finitely many immediate predecessors, all of which are characterized by a finite algebra. (shrink)

The veiled recession frame has served several times in the literature to provide examples of modal logics failing to have certain desirable properties. Makinson [4] was the first to use it in his presentation of a modal logic without the finite model property. Thomason [5] constructed a (rather complicated) logic whose Kripke frames have an accessibility relation which is reflexive and transitive, but which is satisfied by the (non-transitive) veiled recession frame, and hence incomplete. In Van Benthem [2] the frame (...) was an essential tool to find simple examples of incomplete logics, axiomatized by a formula in two proposition letters of degree 2, or by a formula in one proposition letter of degree 4 (the degree of a modal formula is the maximal number of nested occurrences of the necessity operator in ). In [3] we showed that the modal logic determined by the veiled recession frame is incomplete, and besides that, is an immediate predecessor of classical logic (or, more precisely, the modal logic axiomatized by the formula pp), and hence is a logic, maximal among the incomplete ones. Considering the importance of the modal logic determined by the veiled recession frame, it seems worthwhile to ask for an axiomatization, and in particular, to answer the question if it is finitely axiomatizable. In the present paper we find a finite axiomatization of the logic, and in fact, a rather simple one consisting of formulas in at most two proposition letters and of degree at most three. (shrink)

In the following we will use the well-known correspondence between modal logics and varieties of modal algebras in our investigation of the function which assigns to a modal logic its degree of incompleteness. A modal algebra is an algebra A = where is a Boolean algebra and is a unary operation satisfying 1 = 1 and = x y ; is called a modal operator. A variety of algebras is a class of algebras closed under the operations of forming homomorphic (...) images, subalgebras as and direct products, and if K is a class of algebras then V denotes the smallest variety containing K. The variety of modal algebras is denoted by M, the subvariety of M dened by the equation x x = x by MR and the subvariety of M dened by the equation x n = x n1 , n a natural number, by Mn . Here x 0 = x, x n = , n a natural number. We write for the lattice of subvarieties of a variety K. If K, K 0 are varieties such that K $ K 0 but for no variety K 00 K $ K 00 $ K 0 then we say that K 0 is a cover of K. The smallest normal modal logic { containing the axiom ! and closed under the inference rules of modus ponens, substitution and necessitation { will be denoted by K; the lattice of modal logics which are extensions of K by. (shrink)

Willem Blok was one of the founders of the field Abstract Algebraic Logic. The paper describes his research in this field.

A well-known result, going back to the twenties, states that, under some reasonable assumptions, any logic can be characterized as the set of formulas satisfied by a matrix 〈,F〉, whereis an algebra of the appropriate type, andFa subset of the domain of, called the set of designated elements. In particular, every quasi-classical modal logic—a set of modal formulas, containing the smallest classical modal logicE, which is closed under the inference rules of substitution and modus ponens—is characterized by such a matrix, (...) wherenow is a modal algebra, andFis a filter of. If the modal logic is in fact normal, then we can do away with the filter; we can study normal modal logics in the setting of varieties of modal algebras. This point of view was adopted already quite explicitly in McKinsey and Tarski [8]. The observation that the lattice of normal modal logics is dually isomorphic to the lattice of subvarieties of a variety of modal algebras paved the road for an algebraic study of normal modal logics. The algebraic approach made available some general results from Universal Algebra, notably those obtained by Jónsson [6], and thereby was able to contribute new insights in the realm of normal modal logics [2], [3], [4], [10].The requirement that a modal logic be normal is rather a severe one, however, and many of the systems which have been considered in the literature do not meet it. For instance, of the five celebrated modal systems, S1–S5, introduced by Lewis, S4 and S5 are the only normal ones, while only SI fails to be quasi-classical. The purpose of this paper is to generalize the algebraic approach so as to be applicable not just to normal modal logics, but to quasi-classical modal logics in general. (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)