University of Oxford, Michaelis November 16, Categorical Semantics and Topos Theory Homotopy type theor
|
|
- Job French
- 5 years ago
- Views:
Transcription
1 Categorical Semantics and Topos Theory Homotopy type theory Seminar University of Oxford, Michaelis 2011 November 16, 2011
2 References Johnstone, P.T.: Sketches of an Elephant. A Topos-Theory Compendium. Oxford University Press, (Main source) Caramello, O.: Lectures on Topos Theory. Cambridge, (Additional source) Bell, J.L.: Notes on Toposes and Local Set Theories (Additional source) Moerdijk, I. and Mac Lane, S.: Sheaves in Geometry and Logic: A First Introduction to Topos Theory. Springer, Abramsky, S. and Tzevelekos, N.: Introduction to Categories and Categorical Logic. Oxford.
3 Introduction Let s start with a simple example. The definition of a group can be realized in many different categories: Sets FinSets Top Sh(X), X topological space G any group G finite group G topological group G sheaf of groups. We call the purely axiomatic definition of a group the syntax and the different realizations in categories semantics. Properties of groups can be proved on the syntactic level, and then also hold on the semantic level. Categorical semantics makes this relationship, which we often use, precise. Note: All the categories Sets, FinSets, Top, Sh(X) are examples of toposes. Aim: To give an idea the relation between syntax and semantics, and to advertise toposes as mathematical universes.
4 Logic and Lattices Definition: A preorder is a category with at most one morphism for each pair of objects. A partially ordered set (poset) is a small preorder where the only isomorphisms are identity morphism. A lattice is a poset L where each pair x, y L has a supremum (join) x y and an infimum (meet) x y. Remark: Note that and are product, respectively coproducts in L seen as a category. We say a lattice is complete if is is complete (and hence cocomplete) as a category, i.e. all small limits (and colimits) exist. Here, this just means that each subset of L has an infimum and supremum. In particular, = L =: 0, bottom (initial), = L =: 1, top (terminal) exist. Such a lattice is called bounded.
5 Logic and Lattices Definition: A Heyting algebra is a bounded lattice H s.t. for all x, y H, there exists an element x y H s.t. z (x y) z x y, z H. This is the largest element z s.t. z x y. We write x := x 0, the pseudocomplement of x. A Boolean algebra B is a complete latte s.t. ( x) = x, x B, x x = 1, x B. Proposition: H is a complete Heyting algebra if and only if H is a complete lattice and x i I y i = i I (x y i ), x, y i H, for any set I.
6 Logic and Lattices As the notations suggest, these structures are closely related to logic, in particular propositional logic. Classical propositional logic Boolean algebras Intuitionistic propositional logic Heyting algebras Free intuitionistic logic (with, ) Complete Heyting algebras. Classical logic allows the Law of Excluded Middle, while intuitionistic logic does not. By these correspondences, I mean certain completeness, more about this later.
7 Signatures and Theories Brief introduction to how Logic formalizes mathematics. Back to our example, groups Signature: One type: G; one constant (function) symbol (0-ary): 1; two function symbols inv : G G (1-ary), and : G G G (2-ary). Axioms: x (x 1 = x 1 x = 1) x (x x 1 = 1 x 1 x = 1) x,y,z (x y) z = x (y z).
8 Signatures and Theories More generally: Definition: A signature Σ consists of Types (or sorts). Function symbols, each such f has a configuration f : A 1... A n B, where A 1,..., A n, B are types (f is n-ary). 0-ary function symbols are called constants. Relation symbols, each such R has a configuration R A 1... A n, where A 1,..., A n, B are types (R is n-ary). 0-ary relation symbols are called propositions.
9 Signatures and Theories Given a signature Σ, we can recursively define terms over Σ (I) x : A means x is a variable of type A. (II) f (t 1,..., t n ) : B if f : A 1... A n B is a function symbol, and t i : A i are terms.
10 Signatures and Theories From terms, we can build up formulae recursively by applying Relations: R(t 1,..., t n ) is a formula if R A 1... A n is a relation symbol, and t i : A i are types. We assume that there is always the relation symbol equality = A A. Truth and falsity: Truth and falsity are formulae without variables. Binary constructs: conjunction φ ψ, disjunction φ ψ, and implication φ ψ are formulae provided φ and ψ are. Quantification: ( x)φ and ( x)φ are formulae for x a variable and φ a formulae. Sometimes infinitary disjunction and conjunction are included. First order logic does not allow infinitary conjunction and disjunction. If these occur, we are in higher order logic.
11 Signatures and Theories Definition: A sequent over Σ is an expression φ x1,...,x n ψ, where φ, ψ are formulae, and x 1,..., x n are variables containing at least all free variables in φ and ψ, i.e. those not being bound by a quantifier or (such a context is suitable for φ and ψ). The interpretation of such a sequent is that for all x 1,..., x n, φ(x 1,..., x n ) implies ψ(x 1,..., x n ). We can now define what a theory T over Σ is: it is just a collection of sequents, which we call the axioms of T. Examples: See above for groups. The theory of categories can be formulated using two sorts O and M, 2-categories with three sorts O, M 1, and M 2, etc.
12 Signatures and Theories In logic, we are interested in proof rather than validity of certain statements. We want to know what follows from what?. This is formulated using formal or natural derivations Γ σ where Γ is a collection of sequents, and σ is a sequent. This is interpreted as Γ collectively implies σ. There are, depending on what kind of logic we are working with, certain structural rules and axioms which are assumed to be given. Many of them may seem like trivialities, but have to be specified on such an elementary level. For example, φ ψ χ σ Cut rule, or φ ψ
13 Signatures and Theories φ ψ φ χ Rule for. φ ψ χ An important example of an axiom is the Law of Excluded Middle x1,...,x n (φ φ), which is not derivable in intuitionistic logic. It gives the basis for proofs by contradiction in classical logic. Example for natural deduction: Implication is associative: A B, B C, A A B A B, B C, A A Elimination A B, B C, A B C A B, B C, A B Elimination A B, B C, A C Rule for A B, B C A C
14 Toposes Toposes are almost as nice as sets. Let s see what makes Set special. For sets, we have the well-known adjunction Hom(Z X, Y ) = Hom(Z, Y X ), where Y X = {f : X Y }. That is, ( ) X ( ) X as functors. We want to generalize this idea. Definition: Let C be a category with finite products. We say that A Ob C is exponentiable if the functor ( ) A has a right adjoint, denoted by ( ) A. A category C is called cartesian closed if it has all finite products and exponentials. Cartesian functors are those preserving these structures.
15 Toposes Remark: The counit ɛ B : B A A B gives an evaluation map, i.e. h C A B!g Id A B A A ɛ B commutes for any such morphism h. In Set, ɛ B (f, a) = f (a), and g(c) = (a h(c, a)).
16 Toposes Example: We have exponentials in the functor category [O(X ) op, Set] := Fun(O(X ) op, Set) for a topological space X (this is called a presheaf topos). They can be found using the Yoneda lemma: R Q (C) Yoneda = Hom [O(X ) op,set](yc, R Q ) assuming exp. exist = Hom [O(X ) op,set](yc Q, R). }{{} use as definition for presheaves Q, R and an open set C (yc is the image of C under the Yoneda embedding). If Q, R are sheaves, then so is R Q, i.e. Sh(X ) has the same exponentials as [O(X ) op, Set].
17 Toposes In Set, we can describe subset by classifying arrows, i.e for S X we have { 1 if x S χ S : X Ω := {0, 1}, x 0 if x / S. This map contains all the information about S. Denote by the function 1. Then true: { } = 1 Set Ω ι S 1 { } true χ S X Ω is a pullback square, Ω = {0, 1} is the set of truth values.
18 Toposes We can categorify this: Definition: Let C be a category with all finite limits. A subobject classifier is an object Ω with a map true: 1 C Ω s.t. for each monomorphism m : A A there is a unique morphism χ m : A Ω (called classifying arrow of m) s.t. A 1 1 C is a pullback square. m A χ m Ω true
19 Toposes Remark: We denote by Sub C the lattice of subobjects of A. For a subobject, the classifying arrow is unique only up to isomorphism of morphisms. For a morphism f : A B, pullback induces a mapping Sub C B Sub C A. Thus we have a functor Sub C : C op Set which is, provided C is locally small, represented by the pair (Ω, true).
20 Toposes Definition (Lawvere-Tierney): A topos is category C with all finite limits, exponentials, and a subobject classifier. Remark: This implies that C also has all finite colimits. Examples: For any topological space X, the category of sheaves on X, Sh(X ), is a topos. More generally, one can define Sh(C, J) for any small category C and a Grothendieck topology J, this is a generalization of the notion of covering used to define sheaves. Such a topos is called a Grothendieck topos. It has the advantage that it is cocomplete and all colimits commute with finite limits, hence it is categorically as good as Set, which is also a topos.
21 Toposes Toposes may be seen as mathematical universes (i.e. we can perform logic in them) because of the following fact: Theorem: For each topos, the subobject sets Sub C A have the structure of a Heyting algebra (complete for Grothendieck toposes). We call the logical operations in these subobject lattices the external Heyting algebra of the topos. The Yoneda lemma gives that these operations are described by a model structure on Ω, the so-called internal Heyting algebra of the topos. By this, we mean here that for each logical operation, we have maps from powers of Ω to Ω, e.g. : Ω Ω Ω, induced by conjunction on the subobject lattices.
22 Toposes Thus toposes give a way of doing logic in them, more specifically Toposes First order logic Grothendieck toposes Geometric logic, having infinitary conjunction and disjunction.
23 Categorical Semantics We want to interpret theories in categories. First, we look at realizations of signatures: Definition: Let C be a category with finite limits and Σ a signature. A Σ-structure M in C consists of An object MA for each type A of Σ, s.t. M(A 1... A n ) = MA 1... MA n. A morphism Mf : MA 1... MA n MB for each function symbol f : A 1... A n B of Σ. A subobject MR MA 1... MA n for each relation symbol R A 1... A n of Σ.
24 Categorical Semantics A Σ-structure homomorphism h : N M between two Σ-structures M and N is a collection of morphisms h A : MA NA, for each type A in Σ, s.t. For any f : A 1... A n B in Σ, MA 1... MA n Mf MB commutes. h A1... h An Nf NA 1... NA n h B NB
25 Categorical Semantics For each relation symbol R A 1... A n in Σ, MR > MA1... MA n commutes. h A1... h An NR > NA1... NA n Any finite limit preserving functor F : C D transfers Σ-structures in C into Σ-structures in D.
26 Categorical Semantics We can recursively define how to interpret terms in context { x.t}, where x = x 1,..., x n is a list of variables containing those occurring in t, as morphisms [[ x.t]] M : MA 1... MA n MB. (I) If t is a variable of type A i, then [[ x.t]] M = π i : MA 1... MA n MA i is the projection on the i-th component. (II) If t = f (t 1,..., t n ), t i : C i, then [[ x.t]] M = Mf ([[ x.t 1 ]] M,..., [[ x.t 1 ]] M ).
27 Categorical Semantics To interpret formulae in C, we need to assume that C has enough structure. Formulae in context { x.φ} will be interpreted as subobjects [[ x.φ]] M MA 1... MA n Sub C MA 1... MA n. These subobject lattice are all Heyting algebras in a topos. Thus, for a topos, we have enough structure to interpret,,,,, of formulae in it. One just uses the corresponding operations in the subobject lattices. Note that formulae build up using relation symbols are interpreted using the pullback, i.e. if R B 1... B m and t i : A i are terms with a list of variable x = x 1,..., x n, x i : A i, suitable for all of them, define [[ x.r(t 1,..., t m )]] M by the subobject in the pullback square
28 Categorical Semantics [[ x.r(t 1,..., t m )]] M MR MA 1... MA n ([[ x.t 1 ]] M,..., [[ x.t m ]] M ) MB 1... MB m. We say that a sequent φ x ψ is valid in M if [[ x.φ]] M [[ x.ψ]] M as subobjects. A model of a theory T is a Σ-structure M in which all axioms of T are satisfied.
29 Categorical Semantics Let X, Y be sets. For S X Y, consider p : X Y Y which induces a functor p : P(Y ) P(X Y ), T p 1 (T ) = X T. Now p S := {y Y x X, (x, s) S}, and p S := {y Y x X, (x, y) S} define functors p, p : P(X Y ) P(Y ) satisfying the chain of adjunctions p p p, i.e. p S T S X T X T S T p S.
30 Categorical Semantics More generally, in a topos C f : A B induces f : Sub C B Sub C A preserving the lattice structures. This functor has adjoints f f f. These adjunctions give a way of interpreting the quantifiers and in C.
31 Categorical Semantics An important feature of categorical semantics is that it gives a way of arguing in a pointless category as if there where elements. In a signature, variables x : A may be interpreted as x A. Hence we can still interpret formulae using variables in categories in which the objects are no sets. One can also proceed conversely. Given a category C one can define the canonical signature Σ C of C as having a type A for each object, a function symbol f : A B for each morphism f : A B in C, and a relation symbol R A for each subobject R A in C. In addition, all the compositional identities in C are formulated as axioms in Σ C. If C is a topos one can for example proof f is mono in C f (x) = f (y) x,y x = y is derivable in Σ C. Thus, Σ C gives a way of arguing in a topos using elements.
32 Soundness and Completeness Soundness is the property one naturally expects from a well-defined way of interpreting logic in a category. Theorem: Let T be a first-order theory over Σ. If a sequent σ is derivable in T, then σ is valid in any T-model in any topos. Proof (Sketch): One needs to verify that all the structural rules Γ ω hold in any model M satisfying the axioms of T in the following way: If all the sequents of Γ hold in M, then so does ω. For most rules, this is trivial, e.g. for the Cut rule φ x ψ χ x λ φ x ψ this just means that [[ x.φ]] M [[ x.ψ]] M, and [[ x.χ]] M [[ x.λ]] M implies [[ x.φ]] M [[ x.ψ]] M, i.e. φ x ψ holds in M.
33 Soundness and Completeness One is also interested in the converse of the Soundness Theorem, the so-called Completeness Theorem. Such a theorem was first found for classical logic in Set: Classical Completeness (Gödel, 1929): Let T be a coherent theory (this is basically a first order theory only using,,,, with some extra axioms) then a sequent σ is derivable in T using classical logic if and only if it is valid in each model of T in Set. To prove completeness, one constructs a model M T with the property that a sequent is valid in M T if and only if it is derivable in T.
34 Soundness and Completeness Toposes satisfy completeness with respect to all first order theories: Theorem (Completeness): Let Σ be a signature. Then a first order formula { x.φ} over Σ is provable in intuitionistic first order logic if it is valid in every Σ-structure in any elementary topos. The proof of this uses Kripke-Joyal semantics. Starting with a propositional theory P, one can find a Kripke frame which is a Heyting algebra and contains all the information about validity of propositions in P. For a more general intuitionistic theory T, one obtains a collection of Kripke frames {U p } p P related by a poset P. Then these Kripke models {U p } correspond to a model U in [P, Set] which is also a Kripke frame, and sequents are valid in all U p if and only if they are valid in U. This completeness justifies the view of toposes as mathematical universes.
Topos Theory. Lectures 17-20: The interpretation of logic in categories. Olivia Caramello. Topos Theory. Olivia Caramello.
logic s Lectures 17-20: logic in 2 / 40 logic s Interpreting first-order logic in In Logic, first-order s are a wide class of formal s used for talking about structures of any kind (where the restriction
More informationTopos Theory. Lectures 21 and 22: Classifying toposes. Olivia Caramello. Topos Theory. Olivia Caramello. The notion of classifying topos
Lectures 21 and 22: toposes of 2 / 30 Toposes as mathematical universes of Recall that every Grothendieck topos E is an elementary topos. Thus, given the fact that arbitrary colimits exist in E, we can
More informationTopos-theoretic background
opos-theoretic background Olivia Caramello IHÉS September 22, 2014 Contents 1 Introduction 2 2 erminology and notation 3 3 Grothendieck toposes 3 3.1 he notion of site............................ 3 3.2
More informationMorita-equivalences for MV-algebras
Morita-equivalences for MV-algebras Olivia Caramello* University of Insubria Geometry and non-classical logics 5-8 September 2017 *Joint work with Anna Carla Russo O. Caramello Morita-equivalences for
More informationOlivia Caramello. University of Insubria - Como. Deductive systems and. Grothendieck topologies. Olivia Caramello. Introduction.
duality University of Insubria - Como 2 / 27 duality Aim of the talk purpose of this talk is to illustrate the relevance of the notion of topology. I will show that the classical proof system of geometric
More informationOn the characterization of geometric logic
Utrecht University Faculty of Beta Sciences Mathematical institute Master of Science Thesis On the characterization of geometric logic by Ralph Langendam (3117618) Supervisor: dr. J. van Oosten Utrecht,
More informationSome glances at topos theory. Francis Borceux
Some glances at topos theory Francis Borceux Como, 2018 2 Francis Borceux francis.borceux@uclouvain.be Contents 1 Localic toposes 7 1.1 Sheaves on a topological space.................... 7 1.2 Sheaves
More informationThe interplay between Grothendieck topoi and logic
The interplay between Grothendieck topoi and logic MSc. Thesis, Master Mathematical Sciences, Universiteit Utrecht Jasper Mulder, 3363120 August 26, 2013 Supervisor/First assessor: Dr. J. van Oosten Second
More informationUnbounded quantifiers via 2-categorical logic
via Unbounded via A. University of Chicago March 18, 2010 via Why? For the same reasons we study 1-categorical. 1 It tells us things about 2-categories. Proofs about fibrations and stacks are simplified
More informationACLT: Algebra, Categories, Logic in Topology - Grothendieck's generalized topological spaces (toposes)
ACLT: Algebra, Categories, Logic in Topology - Grothendieck's generalized topological spaces (toposes) Steve Vickers CS Theory Group Birmingham 2. Theories and models Categorical approach to many-sorted
More informationvia Topos Theory Olivia Caramello University of Cambridge The unification of Mathematics via Topos Theory Olivia Caramello
in University of Cambridge 2 / 23 in in In this lecture, whenever I use the word topos, I really mean Grothendieck topos. Recall that a Grothendieck topos can be seen as: a generalized space a mathematical
More informationBoolean Algebra and Propositional Logic
Boolean Algebra and Propositional Logic Takahiro Kato September 10, 2015 ABSTRACT. This article provides yet another characterization of Boolean algebras and, using this characterization, establishes a
More informationThe Morita-equivalence between MV-algebras and abelian l-groups with strong unit
The Morita-equivalence between MV-algebras and abelian l-groups with strong unit Olivia Caramello and Anna Carla Russo December 4, 2013 Abstract We show that the theory of MV-algebras is Morita-equivalent
More informationUnbounded quantifiers and strong axioms in topos theory
Unbounded quantifiers and in topos A. University of Chicago November 14, 2009 The motivating question What is the topos-theoretic counterpart of the strong set-theoretic axioms of Separation, Replacement,
More informationA Grothendieck site is a small category C equipped with a Grothendieck topology T. A Grothendieck topology T consists of a collection of subfunctors
Contents 5 Grothendieck topologies 1 6 Exactness properties 10 7 Geometric morphisms 17 8 Points and Boolean localization 22 5 Grothendieck topologies A Grothendieck site is a small category C equipped
More informationBoolean Algebra and Propositional Logic
Boolean Algebra and Propositional Logic Takahiro Kato June 23, 2015 This article provides yet another characterization of Boolean algebras and, using this characterization, establishes a more direct connection
More informationHigher toposes Internal logic Modalities Sub- -toposes Formalization. Modalities in HoTT. Egbert Rijke, Mike Shulman, Bas Spitters 1706.
Modalities in HoTT Egbert Rijke, Mike Shulman, Bas Spitters 1706.07526 Outline 1 Higher toposes 2 Internal logic 3 Modalities 4 Sub- -toposes 5 Formalization Two generalizations of Sets Groupoids: To keep
More informationCanonical extension of coherent categories
Canonical extension of coherent categories Dion Coumans Radboud University Nijmegen Topology, Algebra and Categories in Logic (TACL) Marseilles, July 2011 1 / 33 Outline 1 Canonical extension of distributive
More informationElementary (ha-ha) Aspects of Topos Theory
Elementary (ha-ha) Aspects of Topos Theory Matt Booth June 3, 2016 Contents 1 Sheaves on topological spaces 1 1.1 Presheaves on spaces......................... 1 1.2 Digression on pointless topology..................
More informationLattice-ordered abelian groups and perfect MV-algebras: a topos-theoretic perspective
Lattice-ordered abelian groups and perfect MV-algebras: a topos-theoretic perspective Olivia CARAMELLO and Anna Carla RUSSO Institut des Hautes Études Scientifiques 35, route de Chartres 91440 Bures-sur-Yvette
More informationfive years later Olivia Caramello TACL 2015, 25 June 2015 Université Paris 7 The theory of topos-theoretic bridges, five years later Olivia Caramello
Université Paris 7 TACL 2015, 25 June 2015 2 / 37 unifying in Mathematics In this lecture, whenever I use the word topos, I really mean Grothendieck topos. was introduced in the paper in 2010. The unification
More informationSJÄLVSTÄNDIGA ARBETEN I MATEMATIK
SJÄLVSTÄNDIGA ARBETEN I MATEMATIK MATEMATISKA INSTITUTIONEN, STOCKHOLMS UNIVERSITET Equivariant Sheaves on Topological Categories av Johan Lindberg 2015 - No 7 MATEMATISKA INSTITUTIONEN, STOCKHOLMS UNIVERSITET,
More informationLecture 9: Sheaves. February 11, 2018
Lecture 9: Sheaves February 11, 2018 Recall that a category X is a topos if there exists an equivalence X Shv(C), where C is a small category (which can be assumed to admit finite limits) equipped with
More informationPointless Topology. Seminar in Analysis, WS 2013/14. Georg Lehner ( ) May 3, 2015
Pointless Topology Seminar in Analysis, WS 2013/14 Georg Lehner (1125178) May 3, 2015 Starting with the motivating example of Stone s representation theorem that allows one to represent Boolean algebras
More informationdenition is that the space X enters the picture only through its poset of open subsets and the notion of a cover. Grothendieck's second basic observat
TOPOI AND COMPUTATION ANDREAS BLASS Mathematics Dept., University of Michigan Ann Arbor, MI 48109, U.S.A. ABSTRACT This is the written version of a talk given at the C.I.R.M. Workshop on Logic in Computer
More informationAdjunctions! Everywhere!
Adjunctions! Everywhere! Carnegie Mellon University Thursday 19 th September 2013 Clive Newstead Abstract What do free groups, existential quantifiers and Stone-Čech compactifications all have in common?
More informationSubtractive Logic. To appear in Theoretical Computer Science. Tristan Crolard May 3, 1999
Subtractive Logic To appear in Theoretical Computer Science Tristan Crolard crolard@ufr-info-p7.jussieu.fr May 3, 1999 Abstract This paper is the first part of a work whose purpose is to investigate duality
More informationAn Outline of Algebraic Set Theory
An Outline of Algebraic Set Theory Steve Awodey Dedicated to Saunders Mac Lane, 1909 2005 Abstract This survey article is intended to introduce the reader to the field of Algebraic Set Theory, in which
More informationU-Sets as a probabilistic set theory
U-Sets as a probabilistic set theory Claudio Sossai ISIB-CNR, Corso Stati Uniti 4, 35127 Padova, Italy sossai@isib.cnr.it Technical Report 05/03 ISIB-CNR, October 2005 Abstract A topos of presheaves can
More informationGelfand spectra in Grothendieck toposes using geometric mathematics
Gelfand spectra in Grothendieck toposes using geometric mathematics Bas Spitters Formerly, Institute for Computing and Information Sciences, University of Nijmegen Steven Vickers bawspitters@gmail.com
More informationFull Lambek Hyperdoctrine: Categorical Semantics for First-Order Substructural Logics
Full Lambek Hyperdoctrine: Categorical Semantics for First-Order Substructural Logics Yoshihiro Maruyama Quantum Group, Dept. of Computer Science, University of Oxford http://researchmap.jp/ymaruyama Abstract.
More informationCategorical Models of Constructive Logic
Categorical Models of Constructive Logic Thomas STREICHER Fachbereich 4 Mathematik, TU Darmstadt Schloßgartenstr. 7, D-64289 Darmstadt streicher@mathematik.tu-darmstadt.de January 2003 1 Introduction If
More informationTOPOSES ARE SYMMETRIC MONOIDAL CLOSED CATEGORIES
Please cite this article as: Viliam Slodičák, Toposes are symmetric monoidal closed categories, Scientific Research of the Institute of Mathematics and Computer Science, 2012, Volume 11, Issue 1, pages
More informationPART I. Abstract algebraic categories
PART I Abstract algebraic categories It should be observed first that the whole concept of category is essentially an auxiliary one; our basic concepts are those of a functor and a natural transformation.
More information1. Introduction and preliminaries
Quasigroups and Related Systems 23 (2015), 283 295 The categories of actions of a dcpo-monoid on directed complete posets Mojgan Mahmoudi and Halimeh Moghbeli-Damaneh Abstract. In this paper, some categorical
More informationarxiv: v2 [math.ag] 15 May 2016
Syntactic categories for Nori motives Luca Barbieri-Viale Olivia Caramello Laurent Lafforgue arxiv:1506.06113v2 [math.ag] 15 May 2016 Abstract We give a new construction, based on categorical logic, of
More informationThe Morita-equivalence between MV-algebras and abelian l-groups with strong unit
The Morita-equivalence between MV-algebras and abelian l-groups with strong unit Olivia Caramello and Anna Carla Russo arxiv:1312.1272v2 [math.ct] 22 Apr 2014 April 22, 2014 Abstract We show that the theory
More informationLOCALES AND TOPOSES AS SPACES
Chapter 1 LOCALES AND TOPOSES AS SPACES Steven Vickers University of Birmingham 1. Introduction Second Reader Guram Bezhanishvili New Mexico State University Mac Lane and Moerdijk, 1992, in their thorough
More informationCategory Theory. Travis Dirle. December 12, 2017
Category Theory 2 Category Theory Travis Dirle December 12, 2017 2 Contents 1 Categories 1 2 Construction on Categories 7 3 Universals and Limits 11 4 Adjoints 23 5 Limits 31 6 Generators and Projectives
More informationAn introduction to Yoneda structures
An introduction to Yoneda structures Paul-André Melliès CNRS, Université Paris Denis Diderot Groupe de travail Catégories supérieures, polygraphes et homotopie Paris 21 May 2010 1 Bibliography Ross Street
More informationPostulated colimits and left exactness of Kan-extensions
Postulated colimits and left exactness of Kan-extensions Anders Kock If A is a small category and E a Grothendieck topos, the Kan extension LanF of a flat functor F : A E along any functor A D preserves
More informationGrothendieck toposes as unifying bridges in Mathematics
Grothendieck toposes as unifying bridges in Mathematics Mémoire pour l obtention de l habilitation à diriger des recherches * Olivia Caramello *Successfully defended on 14 December 2016 in front of a Jury
More informationCompactness in Toposes
Algant Master Thesis Compactness in Toposes Candidate: Mauro Mantegazza Advisor: Dr. Jaap van Oosten Coadvisors: Prof. Sandra Mantovani Prof. Ronald van Luijk Università degli Studi di Milano Universiteit
More informationCategories, Proofs and Programs
Categories, Proofs and Programs Samson Abramsky and Nikos Tzevelekos Lecture 4: Curry-Howard Correspondence and Cartesian Closed Categories In A Nutshell Logic Computation 555555555555555555 5 Categories
More informationTopos Semantics for Higher-Order Modal Logic
Topos Semantics for Higher-Order Modal Logic arxiv:1403.0020v1 [math.lo] 28 Feb 2014 Steve Awodey Kohei Kishida Hans-Christoph Kotzsch March 4, 2014 Abstract. We define the notion of a model of higher-order
More informationWilliam J. CookLogic via Topoi NCSU William J. CookLogic via Topoi. Logic via Topoi. CSC591Z: Computational Applied Logic Final Presentation
Logic via Topoi CSC591Z: Computational Applied Logic Final Presentation William J. Cook wjcook@math.ncsu.edu Wednesday, December 8, 2004 1 Categories 2 Def: A category C is a collection of objects Ob(C)
More informationComplex Systems from the Perspective of Category. Theory: II. Covering Systems and Sheaves
Complex Systems from the Perspective of Category Theory: II. Covering Systems and Sheaves Abstract Using the concept of adjunction, for the comprehension of the structure of a complex system, developed
More informationTopos Theory. Jaap van Oosten Department of Mathematics Utrecht University
Topos Theory Jaap van Oosten Department of Mathematics Utrecht University December 25, 2018 Preface These lecture notes were written during a Mastermath (Dutch national programme for master-level courses
More informationCategory theory and set theory: algebraic set theory as an example of their interaction
Category theory and set theory: algebraic set theory as an example of their interaction Brice Halimi May 30, 2014 My talk will be devoted to an example of positive interaction between (ZFC-style) set theory
More informationThe equivalence axiom and univalent models of type theory.
The equivalence axiom and univalent models of type theory. (Talk at CMU on February 4, 2010) By Vladimir Voevodsky Abstract I will show how to define, in any type system with dependent sums, products and
More informationarxiv: v1 [math.ct] 28 Dec 2018
arxiv:1812.10941v1 [math.ct] 28 Dec 2018 Janelidze s Categorical Galois Theory as a step in the Joyal and Tierney result Christopher Townsend December 31, 2018 Abstract We show that a trivial case of Janelidze
More informationAlgebras of Deductions in Category Theory. 1 Logical models from universal algebra
THIRD MATHEMATICAL CONFERENCE OF THE REPUBLIC OF SRPSKA Trebinje, 7 and 8 June 2013 Algebras of Deductions in Category Theory Kosta Dosen Faculty of Philosophy, University of Belgrade, and Mathematical
More informationNotes about Filters. Samuel Mimram. December 6, 2012
Notes about Filters Samuel Mimram December 6, 2012 1 Filters and ultrafilters Definition 1. A filter F on a poset (L, ) is a subset of L which is upwardclosed and downward-directed (= is a filter-base):
More informationCoreflections in Algebraic Quantum Logic
Coreflections in Algebraic Quantum Logic Bart Jacobs Jorik Mandemaker Radboud University, Nijmegen, The Netherlands Abstract Various generalizations of Boolean algebras are being studied in algebraic quantum
More informationLimit Preservation from Naturality
CTCS 2004 Preliminary Version Limit Preservation from Naturality Mario Caccamo 1 The Wellcome Trust Sanger Institute Cambridge, UK Glynn Winskel 2 University of Cambridge Computer Laboratory Cambridge,
More informationA Categorial Semantic Representation of Quantum Event Structures
DOI 10.1007/s10701-013-9733-5 A Categorial Semantic Representation of Quantum Event Structures Elias Zafiris Vassilios Karakostas Received: 23 May 2012 / Accepted: 16 July 2013 Springer Science+Business
More informationA Taste of Categorical Logic Tutorial Notes
A Taste of Categorical Logic Tutorial Notes Lars Birkedal birkedal@cs.au.dk) Aleš Bizjak abizjak@cs.au.dk) October 12, 2014 Contents 1 Introduction 2 2 Higher-order predicate logic 2 3 A first set-theoretic
More informationLocally cartesian closed categories
Locally cartesian closed categories Clive Newstead 80-814 Categorical Logic, Carnegie Mellon University Wednesday 1st March 2017 Abstract Cartesian closed categories provide a natural setting for the interpretation
More informationFOX COMPLETIONS AND LAWVERE DISTRIBUTIONS. Introduction MARTA BUNGE
FOX COMPLETIONS AND LAWVERE DISTRIBUTIONS MARTA BUNGE Contents Introduction. I. The Pure Topology and Branched Coverings II. Probability Distributions and Valuation Locales. III. Monoidal Structures via
More informationCategorical Homotopy Type Theory
Categorical Homotopy Type Theory André Joyal UQÀM MIT Topology Seminar, March 17, 2014 Warning The present slides include corrections and modifications that were made during the week following my talk.
More informationFuzzy sets and presheaves
Fuzzy sets and presheaves J.F. Jardine Department of Mathematics University of Western Ontario London, Ontario, Canada jardine@uwo.ca November 27, 2018 Abstract This note presents a presheaf theoretic
More informationCategorical models of homotopy type theory
Categorical models of homotopy type theory Michael Shulman 12 April 2012 Outline 1 Homotopy type theory in model categories 2 The universal Kan fibration 3 Models in (, 1)-toposes Homotopy type theory
More informationFormally real local rings, and infinitesimal stability.
Formally real local rings, and infinitesimal stability. Anders Kock We propose here a topos-theoretic substitute for the theory of formally-real field, and real-closed field. By substitute we mean that
More informationScattered toposes. Received 1 April 1999; received in revised form 1 July 1999 Communicated by I. Moerdijk
Annals of Pure and Applied Logic 103 (2000) 97 107 www.elsevier.com/locate/apal Scattered toposes Leo Esakia a, Mamuka Jibladze b;, Dito Pataraia c; 1 a Institute of Cybernetics, Tbilisi, Georgia b Departement
More informationAlgebraically Closed Fields
Thierry Coquand September 2010 Algebraic closure In the previous lecture, we have seen how to force the existence of prime ideals, even in a weark framework where we don t have choice axiom Instead of
More informationLecture 2: Syntax. January 24, 2018
Lecture 2: Syntax January 24, 2018 We now review the basic definitions of first-order logic in more detail. Recall that a language consists of a collection of symbols {P i }, each of which has some specified
More informationLecture 1: Overview. January 24, 2018
Lecture 1: Overview January 24, 2018 We begin with a very quick review of first-order logic (we will give a more leisurely review in the next lecture). Recall that a linearly ordered set is a set X equipped
More informationAn introduction to toposes. Richard Pettigrew Department of Philosophy University of Bristol
n introduction to toposes Richard Pettigrew Department of Philosophy University of Bristol Contents 1 Motivating category theory 1 1.1 The idea behind category theory.................. 1 2 The definition
More informationModels of Intuitionistic Set Theory in Subtoposes of Nested Realizability Toposes
Models of Intuitionistic Set Theory in Subtoposes of Nested Realizability Toposes S. Maschio Dipartimento di Matematica, Università di Padova Via Trieste, Padova samuele.maschio@math.unipd.it T. Streicher
More informationIntroduction to Model Theory
Introduction to Model Theory Charles Steinhorn, Vassar College Katrin Tent, University of Münster CIRM, January 8, 2018 The three lectures Introduction to basic model theory Focus on Definability More
More informationOn the Bourbaki-Witt Principle in Toposes
On the Bourbaki-Witt Principle in Toposes Andrej Bauer University of Ljubljana, Slovenia Andrej.Bauer@andrej.com Peter LeFanu Lumsdaine Dalhousie University, Halifax, Canada p.l.lumsdaine@mathstat.dal.ca
More informationPartial Horn logic and cartesian categories
Partial Horn logic and cartesian categories E. Palmgren Department of Mathematics, Uppsala University, PO Box 480, 75106 Uppsala, Sweden. palmgren@math.uu.se S.J. Vickers School of Computer Science, University
More informationFixed-point elimination in Heyting algebras 1
1/32 Fixed-point elimination in Heyting algebras 1 Silvio Ghilardi, Università di Milano Maria João Gouveia, Universidade de Lisboa Luigi Santocanale, Aix-Marseille Université TACL@Praha, June 2017 1 See
More informationOn Paradoxes in Proof-Theoretic Semantics
Quantum Group Dept. of Computer Science Oxford University 2nd PTS Conference, Tübingen, March 8, 2013 Outline 1 Categorical Harmony Logical Constants as Adjoint Functors Comparison with Other Concepts
More informationESSENTIALLY ALGEBRAIC THEORIES AND LOCALIZATIONS IN TOPOSES AND ABELIAN CATEGORIES
ESSENTIALLY ALGEBRAIC THEORIES AND LOCALIZATIONS IN TOPOSES AND ABELIAN CATEGORIES A thesis submitted to the University of Manchester for the degree of Doctor of Philosophy in the Faculty of Engineering
More informationarxiv: v1 [math.lo] 8 Jul 2015
A SYNTACTIC CHARACTERIZATION OF MORITA EQUIVALENCE DIMITRIS TSEMENTZIS arxiv:1507.02302v1 [math.lo] 8 Jul 2015 Abstract. We characterize Morita equivalence of theories in the sense of Johnstone in [24]
More informationCategories of imaginaries for additive structures
Categories of imaginaries for additive structures Mike Prest Department of Mathematics Alan Turing Building University of Manchester Manchester M13 9PL UK mprest@manchester.ac.uk December 5, 2011 () December
More informationarxiv: v1 [math.ct] 21 Oct 2010
INTERIOR OPERATORS AND TOPOLOGICAL CATEGORIES arxiv:1010.4460v1 [math.ct] 21 Oct 2010 JOAQUÍN LUNA-TORRES a AND CARLOS ORLANDO OCHOA C. b a Universidad Sergio Arboleda b Universidad Distrital Francisco
More informationReview of category theory
Review of category theory Proseminar on stable homotopy theory, University of Pittsburgh Friday 17 th January 2014 Friday 24 th January 2014 Clive Newstead Abstract This talk will be a review of the fundamentals
More informationOn a Categorical Framework for Coalgebraic Modal Logic
On a Categorical Framework for Coalgebraic Modal Logic Liang-Ting Chen 1 Achim Jung 2 1 Institute of Information Science, Academia Sinica 2 School of Computer Science, University of Birmingham MFPS XXX
More informationCategory theory and set theory: examples of their interaction
Category theory and set theory: examples of their interaction Brice Halimi (Paris Ouest University & Sphere) My talk will be composed of three parts: 1. quick review of the basic ping-pong that opposes
More informationLogic for Computational Effects: work in progress
1 Logic for Computational Effects: work in progress Gordon Plotkin and John Power School of Informatics University of Edinburgh King s Buildings Mayfield Road Edinburgh EH9 3JZ Scotland gdp@inf.ed.ac.uk,
More informationtp(c/a) tp(c/ab) T h(m M ) is assumed in the background.
Model Theory II. 80824 22.10.2006-22.01-2007 (not: 17.12) Time: The first meeting will be on SUNDAY, OCT. 22, 10-12, room 209. We will try to make this time change permanent. Please write ehud@math.huji.ac.il
More informationA categorical structure of realizers for the Minimalist Foundation
A categorical structure of realizers for the Minimalist Foundation S.Maschio (joint work with M.E.Maietti) Department of Mathematics University of Padua TACL 2015 Ischia The Minimalist Foundation Many
More informationAn adjoint construction for topological models of intuitionistic modal logic Extended abstract
An adjoint construction for topological models of intuitionistic modal logic Extended abstract M.J. Collinson, B.P. Hilken, D.E. Rydeheard April 2003 The purpose of this paper is to investigate topological
More informationFirst-Order Logic. 1 Syntax. Domain of Discourse. FO Vocabulary. Terms
First-Order Logic 1 Syntax Domain of Discourse The domain of discourse for first order logic is FO structures or models. A FO structure contains Relations Functions Constants (functions of arity 0) FO
More informationELEMENTARY TOPOI: SETS, GENERALIZED
ELEMENTARY TOPOI: SETS, GENERALIZED CHRISTOPHER HENDERSON Abstract. An elementary topos is a nice way to generalize the notion of sets using categorical language. If we restrict our world to categories
More informationConstructive algebra. Thierry Coquand. May 2018
Constructive algebra Thierry Coquand May 2018 Constructive algebra is algebra done in the context of intuitionistic logic 1 H. Lombardi, C. Quitté Commutative Algebra: Constructive Methods, 2016 I. Yengui
More informationThe synthetic theory of -categories vs the synthetic theory of -categories
Emily Riehl Johns Hopkins University The synthetic theory of -categories vs the synthetic theory of -categories joint with Dominic Verity and Michael Shulman Vladimir Voevodsky Memorial Conference The
More informationSyntax. Notation Throughout, and when not otherwise said, we assume a vocabulary V = C F P.
First-Order Logic Syntax The alphabet of a first-order language is organised into the following categories. Logical connectives:,,,,, and. Auxiliary symbols:.,,, ( and ). Variables: we assume a countable
More informationELEMENTARY EQUIVALENCES AND ACCESSIBLE FUNCTORS INTRODUCTION
ELEMENTARY EQUIVALENCES AND ACCESSIBLE FUNCTORS T. BEKE AND J. ROSICKÝ ABSTRACT. We introduce the notion of λ-equivalence and λ-embeddings of objects in suitable categories. This notion specializes to
More informationC2.7: CATEGORY THEORY
C2.7: CATEGORY THEORY PAVEL SAFRONOV WITH MINOR UPDATES 2019 BY FRANCES KIRWAN Contents Introduction 2 Literature 3 1. Basic definitions 3 1.1. Categories 3 1.2. Set-theoretic issues 4 1.3. Functors 5
More informationEmbedding locales and formal topologies into positive topologies
Embedding locales and formal topologies into positive topologies Francesco Ciraulo Giovanni Sambin Department of Mathematics, University of Padova Via Trieste 63, 35121 Padova, Italy ciraulo@math.unipd.it,
More informationContextual Semantics in Quantum Mechanics from a Categorical Point of View
Synthese (2017) 194: 847-886 Contextual Semantics in Quantum Mechanics from a Categorical Point of View Vassilios Karakostas and Elias Zafiris ABSTRACT The category-theoretic representation of quantum
More informationQuantum groupoids and logical dualities
Quantum groupoids and logical dualities (work in progress) Paul-André Melliès CNS, Université Paris Denis Diderot Categories, ogic and Foundations of Physics ondon 14 May 2008 1 Proof-knots Aim: formulate
More informationTHEORIES OF PRESHEAF TYPE. Introduction
THEORIES OF PRESHEAF TYPE TIBOR BEKE Introduction Let us say that a geometric theory T is of presheaf type if its classifying topos B[T ] is (equivalent to) a presheaf topos. (We adhere to the convention
More informationVarieties of Heyting algebras and superintuitionistic logics
Varieties of Heyting algebras and superintuitionistic logics Nick Bezhanishvili Institute for Logic, Language and Computation University of Amsterdam http://www.phil.uu.nl/~bezhanishvili email: N.Bezhanishvili@uva.nl
More informationarxiv: v3 [math.ct] 27 Jun 2011
An informal introduction to topos theory arxiv:1012.5647v3 [math.ct] 27 Jun 2011 Contents Tom Leinster 1 The definition of topos 3 2 Toposes and set theory 7 3 Toposes and geometry 13 4 Toposes and universal
More informationModel Theory MARIA MANZANO. University of Salamanca, Spain. Translated by RUY J. G. B. DE QUEIROZ
Model Theory MARIA MANZANO University of Salamanca, Spain Translated by RUY J. G. B. DE QUEIROZ CLARENDON PRESS OXFORD 1999 Contents Glossary of symbols and abbreviations General introduction 1 xix 1 1.0
More informationPropositional Logics and their Algebraic Equivalents
Propositional Logics and their Algebraic Equivalents Kyle Brooks April 18, 2012 Contents 1 Introduction 1 2 Formal Logic Systems 1 2.1 Consequence Relations......................... 2 3 Propositional Logic
More information