Free Q-distributive lattices

The dual spaces of the free distributive lattices with a quantifier are constructed, generalizing Halmos' construction of the dual spaces of free monadic Boolean algebras.     

Semi-DeMorgan algebras

Semi-DeMorgan algebras are a common generalization of DeMorgan algebras and pseudocomplemented distributive lattices. A duality for them is developed that builds on the Priestley duality for distributive lattices. This duality is then used in several applications. The subdirectly irreducible semi-DeMorgan algebras are characterized. A theory of partial diagrams is developed, where properties of algebras are tied to the omission of certain partial diagrams from their duals. This theory is then used to find and give axioms for the largest variety of semi-DeMorgan algebras with the congruence extension property.Semi-deMorgan algebras include demi-p-lattices, the topic of H. Gaitan's contribution to this special edition. D. Hobby's results were obtained independently.     

Interpolation and Amalgamation; Pushing the Limits. Part I

Continuing work initiated by Jónsson, Daigneault, Pigozzi and others; Maksimova proved that a normal modal logic (with a single unary modality) has the Craig interpolation property iff the corresponding class of algebras has the superamalgamation property (cf. [Mak 91], [Mak 79]). The aim of this paper is to extend the latter result to a large class of logics. We will prove that the characterization can be extended to all algebraizable logics containing Boolean fragment and having a certain kind of local deduction property. We also extend this characterization of the interpolation property to arbitrary logics under the condition that their algebraic counterparts are discriminator varieties. We also extend Maksimova's result to normal multi-modal logics with arbitrarily many, not necessarily unary modalities, and to not necessarily normal multi-modal logics with modalities of ranks smaller than 2, too.The problem of extending the above characterization result to no n-normal non-unary modal logics remains open.Related issues of universal algebra and of algebraic logic are discussed, too. In particular we investigate the possibility of extending the characterization of interpolability to arbitrary algebraizable logics.     

Classifying ℵo-Categorical Theories II: The Existence of Finitely Axiomatizable Proper Class II Theories

Clark and Krauss [1977] presents a classification of complete, satisfiable and _o-categorical theories in first order languages with finite non-logical vocabularies. In 1988 the first author modified this classification and raised three questions about the distribution of finitely axiomatizable theories. This paper answers two of those questions.     

Homogeneous and Universal Dedekind Algebras

A Dedekind algebra is an order pair (B, h) where B is a non-empty set and h is a similarity transformation on B. Each Dedekind algebra can be decomposed into a family of disjoint, countable subalgebras called the configurations of the algebra. There are ₀ isomorphism types of configurations. Each Dedekind algebra is associated with a cardinal-valued function on called its configuration signature. The configuration signature counts the number of configurations in each isomorphism type which occur in the decomposition of the algebra. Two Dedekind algebras are isomorphic iff their configuration signatures are identical. It is shown that configuration signatures can be used to characterize the homogeneous, universal and homogeneous-universal Dedekind algebras. This characterization is used to prove various results about these subclasses of Dedekind algebras.     

Mathematical modal logic: A view of its evolution

This is a survey of the origins of mathematical interpretations of modal logics, and their development over the last century or so. It focuses on the interconnections between algebraic semantics using Boolean algebras with operators and relational semantics using structures often called Kripke models. It reviews the ideas of a number of people who independently contributed to the emergence of relational semantics, and compares them with the work of Kripke. It concludes with an account of several applications of modal model theory to mathematics and theoretical computer science.     

Squares in Fork Arrow Logic

In this paper we show that the class of fork squares has a complete orthodox axiomatization in fork arrow logic (FAL). This result may be seen as an orthodox counterpart of Venema's non-orthodox axiomatization for the class of squares in arrow logic. FAL is the modal logic of fork algebras (FAs) just as arrow logic is the modal logic of relation algebras (RAs). FAs extend RAs by a binary fork operator and are axiomatized by adding three equations to RAs equational axiomatization. A proper FA is an algebra of relations where the fork is induced by an injective operation coding pair formation. In contrast to RAs, FAs are representable by proper ones and their equational theory has the expressive power of full first-order logic. A square semantics (the set of arrows is U×U for some set U) for arrow logic was defined by Y. Venema. Due to the negative results about the finite axiomatizability of representable RAs, Venema provided a non-orthodox finite axiomatization for arrow logic by adding a new rule governing the applications of a difference operator. We address here the question of extending the type of relational structures to define orthodox axiomatizations for the class of squares. Given the connections between this problem and the finitization problem addressed by I. Németi, we suspect that this cannot be done by using only logical operations. The modal version of the FA equations provides an orthodox axiomatization for FAL which is complete in view of the representability of FAs. Here we review this result and carry it further to prove that this orthodox axiomatization for FAL also axiomatizes the class of fork squares.     

Computing with Cylindric Modal Logics and Arrow Logics,Lower Bounds

The complexity of the satisfiability problems of various arrow logics and cylindric modal logics is determined. As is well known, relativising these logics makes them decidable. There are several parameters that can be set in such a relativisation. We focus on the following three: the number of variables involved, the similarity type and the kind of relativised models considered. The complexity analysis shows the importance and relevance of these parameters.     

A Way to Interpret Łukasiewicz Logic and Basic Logic

Fuzzy logics are in most cases based on an ad-hoc decision about the interpretation of the conjunction. If they are useful or not can typically be found out only by testing them with example data. Why we should use a specific fuzzy logic can in general not be made plausible. Since the difficulties arise from the use of additional, unmotivated structure with which the set of truth values is endowed, the only way to base fuzzy logics on firm ground is the development of alternative semantics to all of whose components we can associate a meaning. In this paper, we present one possible approach to justify ex post Łukasiewicz Logic as well as Basic Logic. The notion of ambiguity is central. Our framework consists of a Boolean or a Heyting algebra, respectively, endowed with an equivalence relation expressing ambiguity. The quotient set bears naturally the structure of an MV- or a BL-algebra, respectively, and thus can be used to interpret propositions of the mentioned logics.