6 research outputs found

    Definability and Classification of Equivalence Relations and Logical Theories

    Get PDF
    This thesis consists of four independent papers. In the first paper, joint with Kechris, we study the global aspects of structurability in the theory of countable Borel equivalence relations. For a class K of countable relational structures, a countable Borel equivalence relation E is said to be K-structurable if there is a Borel way to put a structure in K on each E-equivalence class. We show that K-structurability interacts well with various preorders commonly used in the classification of countable Borel equivalence relations. We consider the poset of classes of K-structurable equivalence relations for various K, under inclusion, and show that it is a distributive lattice. Finally, we consider the effect on K-structurability of various model-theoretic properties of K; in particular, we characterize the K such that every K-structurable equivalence relation is smooth. In the second paper, we consider the classes of Kn-structurable equivalence relations, where Kn is the class of n-dimensional contractible simplicial complexes. We show that every Kn-structurable equivalence relation Borel embeds into one structurable by complexes in Kn with the further property that each vertex belongs to at most Mn := 2n-1(n2+3n+2)-2 edges; this generalizes a result of Jackson-Kechris-Louveau in the case n=1. In the third paper, we consider the amalgamation property from model theory in an abstract categorical context. A category is said to have the amalgamation property if every pushout diagram has a cocone. We characterize the finitely generated categories I such that in every category with the amalgamation property, every I-shaped diagram has a cocone. In the fourth paper, we prove a strong conceptual completeness theorem (in the sense of Makkai) for the infinitary logic L&#x03C9;1&#x03C9;: every countable L&#x03C9;1&#x03C9;-theory can be canonically recovered from its standard Borel groupoid of countable models, up to a suitable syntactical notion of equivalence. This implies that given two theories (L,T) and (L',T'), every Borel functor Mod(L',T') &#x2192; Mod(L,T) between the respective groupoids of countable models is Borel naturally isomorphic to the functor induced by some L'&#x03C9;1&#x03C9;-interpretation of T in T', which generalizes a recent result of Harrison-Trainor, Miller, and Montalban in the case where T, T' are &#x2135;0-categorical.</p

    Foundations of Software Science and Computation Structures

    Get PDF
    This open access book constitutes the proceedings of the 23rd International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2020, which took place in Dublin, Ireland, in April 2020, and was held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020. The 31 regular papers presented in this volume were carefully reviewed and selected from 98 submissions. The papers cover topics such as categorical models and logics; language theory, automata, and games; modal, spatial, and temporal logics; type theory and proof theory; concurrency theory and process calculi; rewriting theory; semantics of programming languages; program analysis, correctness, transformation, and verification; logics of programming; software specification and refinement; models of concurrent, reactive, stochastic, distributed, hybrid, and mobile systems; emerging models of computation; logical aspects of computational complexity; models of software security; and logical foundations of data bases.

    MV-algebras, Grothendieck toposes and applications

    Get PDF
    2014 - 2015This thesis is a contribution to the research program ‘toposes as bridges’ introduced in [12], which aims at developing the unifying potential of the notion of Grothendieck topos as a means for relating different mathematical theories to each other through topos-theoretic invariants. The general methodology outlined therein is applied here to study already existing categorical equivalences of particular interest arising in the field of many-valued logics and also to produce new ones. The original content of the disseration is contained in [22], [21] and [23]... [edited by Author]XIV n.s

    35th Symposium on Theoretical Aspects of Computer Science: STACS 2018, February 28-March 3, 2018, Caen, France

    Get PDF
    corecore