80 research outputs found

    Topological Representation of Canonicity for Varieties of Modal Algebras

    Get PDF
    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

    Coalgebraic completeness-via-canonicity for distributive substructural logics

    Get PDF
    We prove strong completeness of a range of substructural logics with respect to a natural poset-based relational semantics using a coalgebraic version of completeness-via-canonicity. By formalizing the problem in the language of coalgebraic logics, we develop a modular theory which covers a wide variety of different logics under a single framework, and lends itself to further extensions. Moreover, we believe that the coalgebraic framework provides a systematic and principled way to study the relationship between resource models on the semantics side, and substructural logics on the syntactic side.Comment: 36 page

    Forward and Backward Steps in a Fibration

    Get PDF
    Distributive laws of various kinds occur widely in the theory of coalgebra, for instance to model automata constructions and trace semantics, and to interpret coalgebraic modal logic. We study steps, which are a general type of distributive law, that allow one to map coalgebras along an adjunction. In this paper, we address the question of what such mappings do to well known notions of equivalence, e.g., bisimilarity, behavioural equivalence, and logical equivalence. We do this using the characterisation of such notions of equivalence as (co)inductive predicates in a fibration. Our main contribution is the identification of conditions on the interaction between the steps and liftings, which guarantees preservation of fixed points by the mapping of coalgebras along the adjunction. We apply these conditions in the context of lax liftings proposed by Bonchi, Silva, Sokolova (2021), and generalise their result on preservation of bisimilarity in the construction of a belief state transformer. Further, we relate our results to properties of coalgebraic modal logics including expressivity and completeness

    Preservation and reflection of bisimilarity via invertible steps

    Get PDF
    In the theory of coalgebras, distributive laws give a general perspective on determinisation and other automata constructions. This perspective has recently been extended to include so-called weak distributive laws, covering several constructions on state-based systems that are not captured by regular distributive laws, such as the construction of a belief-state transformer from a probabilistic automaton, and ultrafilter extensions of Kripke frames. In this paper we first observe that weak distributive laws give rise to the more general notion of what we call an invertible step: a pair of natural transformations that allows to move coalgebras along an adjunction. Our main result is that part of the construction induced by an invertible step preserves and reflects bisimilarity. This covers results that have previously been shown by hand for the instances of ultrafilter extensions and belief-state transformers

    Cocommutative coalgebras: homotopy theory and Koszul duality

    Full text link
    We extend a construction of Hinich to obtain a closed model category structure on all differential graded cocommutative coalgebras over an algebraically closed field of characteristic zero. We further show that the Koszul duality between commutative and Lie algebras extends to a Quillen equivalence between cocommutative coalgebras and formal coproducts of curved Lie algebras.Comment: 38 page

    How to write a coequation

    Get PDF
    There is a large amount of literature on the topic of covarieties, coequations and coequational specifications, dating back to the early seventies. Nevertheless, coequations have not (yet) emerged as an everyday practical specification formalism for computer scientists. In this review paper, we argue that this is partly due to the multitude of syntaxes for writing down coequations, which seems to have led to some confusion about what coequations are and what they are for. By surveying the literature, we identify four types of syntaxes: coequations-as-corelations, coequations-as-predicates, coequations-as-equations, and coequations-as-modal-formulas. We present each of these in a tutorial fashion, relate them to each other, and discuss their respective uses

    Ultraproducts of Tannakian Categories and Generic Representation Theory of Unipotent Algebraic Groups

    Full text link
    The principle of tannakian duality states that any neutral tannakian category is tensorially equivalent to the category Rep_k G of finite dimensional representations of some affine group scheme G and field k, and conversely. Originally motivated by an attempt to find a first-order explanation for generic cohomology of algebraic groups, we study neutral tannakian categories as abstract first-order structures and, in particular, ultraproducts of them. One of the main theorems of this dissertation is that certain naturally definable subcategories of these ultraproducts are themselves neutral tannakian categories, hence tensorially equivalent to Comod_A for some Hopf algebra A over a field k. We are able to give a fairly tidy description of the representing Hopf algebras of these categories, and explicitly compute them in several examples. For the second half of this dissertation we turn our attention to the representation theories of certain unipotent algebraic groups, namely the additive group G_a and the Heisenberg group H_1. The results we obtain for these groups in characteristic zero are not at all new or surprising, but in positive characteristic they perhaps are. In both cases we obtain that, for a given dimension n, if p is large enough with respect to n, all n-dimensional modules for these groups in characteristic p are given by commuting products of representations, with the constituent factors resembling representations of the same group in characteristic zero. We later use these results to extrapolate some generic cohomology results for these particular unipotent groups
    • …
    corecore