Definability and canonicity for Boolean logic with a binary relation

International audienceThis paper studies the concepts of definability and canonicity in Boolean logic with a binary relation. Firstly, it provides formulas defining first-order or second-order conditions on frames. Secondly, it proves that all formulas corresponding to compatible first-order conditions on frames are canonical

Topological Representation of Canonicity for Varieties of Modal Algebras

Thesis (Ph.D.) - Indiana University, Mathematics, 2010The main subject of this dissertation is to approach the question of countable canonicity of varieties of modal algebras from a topological and categorical point of view. The category of coalgebras of the Vietoris functor on the category of Stone spaces provides a class of frames we call sv-frames. We show that the semantic of this frames is equivalent to that of modal algebras so long as we are limited to certain valuations called sv-valuations. We show that the canonical frame of any normal modal logic which is directly constructed based on the logic is an sv-frame. We then define the notion of canonicity of a logic in terms of varieties and their dual classes. We will then prove that any morphism on the category of coalgebras of the Vietoris functor whose codomain is the canonical frame of the minimal normal modal logic are exactly the ones that are invoked by sv-valuations. We will then proceed to reformulate canonicity of a variety of modal algebras determined by a logic in terms of properties of the class of sv-frames that correspond to that logic. We define ultrafilter extension as an operator on the category of sv-frames, prove a coproduct preservation result followed by some equivalent forms of canonicity. Using Stone duality the notion of co-variety of sv-frames is defined. The notion of validity of a logic on a frame is presented in terms of ranges of theory maps whose domain is the given frame. Partial equivalent results on co-varieties of sv-frames are proved. We classify theory maps which are maps invoked by a valuation on a Kripke frame using the classification of sv-theory maps and properties of ultrafilter extension. A negative categorical result concerning the existence of an adjoint functor for ultrafilter extension is also proved

Elementary Canonical Formulae: A Survey on Syntactic, Algorithmic, and Modeltheoretic Aspects

In terms of validity in Kripke frames, a modal formula expresses a universal monadic second-order condition. Those modal formulae which are equivalent to first-order conditions are called elementary. Modal formulae which have a certain persistence property which implies their validity in all canonical frames of modal logics axiomatized with them, and therefore their completeness, are called canonical. This is a survey of a recent and ongoing study of the class of elementary and canonical modal formulae. We summarize main ideas and results, and outline further research perspectives

Residuation algebras with functional duals

We employ the theory of canonical extensions to study residuation algebras whose associated relational structures are functional, i.e., for which the ternary relations associated to the expanded operations admit an interpretation as (possibly partial) functions. Providing a partial answer to a question of Gehrke, we demonstrate that functionality is not definable in the language of residuation algebras (or even residuated lattices), in the sense that no equational or quasi-equational condition in the language of residuation algebras is equivalent to the functionality of the associated relational structures. Finally, we show that the class of Boolean residuation algebras such that the atom structures of their canonical extensions are functional generates the variety of Boolean residuation algebras

Morphisms and Duality for Polarities and Lattices with Operators

Structures based on polarities have been used to provide relational semantics for propositional logics that are modelled algebraically by non-distributive lattices with additional operators. This article develops a first order notion of morphism between polarity-based structures that generalises the theory of bounded morphisms for Boolean modal logics. It defines a category of such structures that is contravariantly dual to a given category of lattice-based algebras whose additional operations preserve either finite joins or finite meets. Two different versions of the Goldblatt-Thomason theorem are derived in this setting