The role of the overlap relation in constructive mathematics
|
|
- Sherilyn Jordan
- 5 years ago
- Views:
Transcription
1 The role of the overlap relation in constructive mathematics Francesco Ciraulo Department of Mathematics and Computer Science University of PALERMO (Italy) ciraulo Constructive Mathematics: Proofs and Computation Fraueninsel, 7-11 June 2010 Francesco Ciraulo - Palermo (IT) - The overlap relation in constructive mathematics - (CMPC 2010) 1/25
2 Overview 1 Overlap algebras & Locales Overlap Algebras and Overt Locales Atoms and Points Regular opens and Dense sublocales Francesco Ciraulo - Palermo (IT) - The overlap relation in constructive mathematics - (CMPC 2010) 2/25
3 Overview 1 Overlap algebras & Locales Overlap Algebras and Overt Locales Atoms and Points Regular opens and Dense sublocales 2 Overlap relation & Dedekind-MacNeille completion The overlap relation for non-complete posets A variation on the Dedekind-MacNeille completion Francesco Ciraulo - Palermo (IT) - The overlap relation in constructive mathematics - (CMPC 2010) 2/25
4 Part I Overlap Algebras & Locales In which the definition of overlap algebra is recalled as well as some well and less well known facts connecting overlap algebras, overt locales and regular open sets. Francesco Ciraulo - Palermo (IT) - The overlap relation in constructive mathematics - (CMPC 2010) 3/25
5 Problem: fill in the blank with a suitable ALGEBRAIC STRUCTURE in such a way that THE DIAGRAM COMMUTES. INTUITIONISTIC world CLASSICAL world Powersets wear classical glasses Powersets algebraize algebraize wear classical glasses cba s Francesco Ciraulo - Palermo (IT) - The overlap relation in constructive mathematics - (CMPC 2010) 4/25
6 Problem: fill in the blank with a suitable ALGEBRAIC STRUCTURE in such a way that THE DIAGRAM COMMUTES. INTUITIONISTIC world CLASSICAL world Powersets wear classical glasses Powersets algebraize algebraize Overlap Algebras wear classical glasses cba s Francesco Ciraulo - Palermo (IT) - The overlap relation in constructive mathematics - (CMPC 2010) 4/25
7 Overlap Algebras = complete lattice + >< binary relation s.t.: x >< y x >< y y z y >< x symmetry x >< z monotonicity x >< y x >< ( x >< (x y) refinement i I y i) ( i I )(x >< y i ) splitting [z >< x].. z >< y x y density Francesco Ciraulo - Palermo (IT) - The overlap relation in constructive mathematics - (CMPC 2010) 5/25
8 Overlap Algebras as Overt Locales A characterization Idea: read x >< y as Pos(x y). 1 overt locales o-algebras Overlap algebras = overt locales + [Pos(z x)]. Pos(z y) x y density 2 1 Vice versa, Pos(x) (x >< x). 2 Not to be confused with the notion of a dense sublocale. Francesco Ciraulo - Palermo (IT) - The overlap relation in constructive mathematics - (CMPC 2010) 6/25
9 Overlap Algebras as a solution to the starting problem: Powersets classically Powersets algebraize? classically cba s algebraize 1 O-algebras are an algebraic version of powersets: P(S) is an o-algebra (the motivating example). P(S) is atomic {z }. (see below) Every atomic o-algebra is a powerset (Sambin). 2 Classically: Overlap algebras = complete Boolean algebras (Vickers) (where: x >< y x y 0). Francesco Ciraulo - Palermo (IT) - The overlap relation in constructive mathematics - (CMPC 2010) 7/25
10 Atoms and points (I) (1) A minimal NON-ZERO element. What is an ATOM? (2) A minimal POSITIVE element. (1) is too weak: one cannot even prove that a singleton is an atom in a powerset! (2) works well (but one needs Pos or >< to define positive for elements). Francesco Ciraulo - Palermo (IT) - The overlap relation in constructive mathematics - (CMPC 2010) 8/25
11 Atoms and points (II) TFAE (in any overt locale) 1 a is a minimal positive element i.e.: Pos(a) and Pos(x) & (x a) = (x = a) 2 a >< x }{{} Pos(a x) a x (for any x); Francesco Ciraulo - Palermo (IT) - The overlap relation in constructive mathematics - (CMPC 2010) 9/25
12 Atoms and points (III) TFAE (in any o-algebra) 1 a is an atom; 2 {x a }{{ >< x } } is a completely prime filter Pos(a x) (in that case {x a >< x} = {x a x}). In other words: the mapping x Pos(a x) is a frame homomorphism if and only if a is an atom. Francesco Ciraulo - Palermo (IT) - The overlap relation in constructive mathematics - (CMPC 2010) 10/25
13 Atoms and points (IV) {atoms of an o algebra} {points of an o algebra} Open questions: {atomic o algebras} {spatial o algebras} What is a spatial o-algebra like? What is the relationship between o-algebras and discrete locales 3? 3 Discrete locale = overt + the diagonal map is open. Francesco Ciraulo - Palermo (IT) - The overlap relation in constructive mathematics - (CMPC 2010) 11/25
14 Regular elements (I) Even if Sambin s density does not hold for an overt locale, in general, nevertheless: [Pos(z x)]. Pos(z y) x y density (in any overt locale) there exists a unique nucleus r s.t.: [Pos(z x)]. Pos(z y) x r(y) Francesco Ciraulo - Palermo (IT) - The overlap relation in constructive mathematics - (CMPC 2010) 12/25
15 Regular elements (II) For L overt, let: L r def = {x L x = r(x)} 1 L r is a o-algebra (hence an overt locale (w.r.t. the same Pos of L)) 2 L = {x L x = x} L r (the least dense sublocale of L) (classically L = L r ) 3 L r is the least positively dense }{{} Pos(r(x)) Pos(x) sublocale of L (this notion has been studied by Bas Spitters) 4 L r = L iff L is an o-algebra (in particular, every o-algebra is of the kind L r ) Francesco Ciraulo - Palermo (IT) - The overlap relation in constructive mathematics - (CMPC 2010) 13/25
16 Regular elements (III) REGULAR open sets = the interior of its closure. Topological closure: (1) complement of the interior of the complement. (2) set of adherent points. Regular elements: (1) x = x (2) x = r(x) Francesco Ciraulo - Palermo (IT) - The overlap relation in constructive mathematics - (CMPC 2010) 14/25
17 Part II Overlap Algebras & Dedekind-MacNeille completion In which a new approach to the Dedekind-MacNeille completion is presented (which works for posets with overlap). Francesco Ciraulo - Palermo (IT) - The overlap relation in constructive mathematics - (CMPC 2010) 15/25
18 Posets with overlap Idea: modify the definition of an overlap relation in such a way that it would make sense for arbitrary posets. x >< y x >< (x y) refinement x >< ( i I y i) ( i I )(x >< y i ) splitting x >< y z(x >< z & z x & z y) i I y i exists x >< ( i I y i) ( i I )(x >< y i ) Francesco Ciraulo - Palermo (IT) - The overlap relation in constructive mathematics - (CMPC 2010) 16/25
19 N.B.: usually, the addition of an overlap relation greatly enrich the underlying structure. For instance, any lattice with overlap is automatically distributive. Moreover (classically): bounded lattice + pseudo-complement + overlap = Boolean algebra Francesco Ciraulo - Palermo (IT) - The overlap relation in constructive mathematics - (CMPC 2010) 17/25
20 Example: Heyting algebras with overlap What happens if one adds an overlap relation to a Heyting algebra? Classically: Heyting algebra + overlap relation = Boolean algebra. Not surprisingly: many classical examples of Boolean algebras (which are no longer so intuitionistically) become Heyting algebras with overlap! Example: a suitable version of the classical Boolean algebra of finite-cofinite subsets. Francesco Ciraulo - Palermo (IT) - The overlap relation in constructive mathematics - (CMPC 2010) 18/25
21 Towards a new kind of completion The case of a Boolean algebra (classically). The Dedekind-MacNeille completion DMN(S) of a poset (S, ) can be presented as the complete lattice of all formal open subsets associated to a (basic) cover relation on S, namely: a U def ( b S) ( ( u U)(u b) a b ). Francesco Ciraulo - Palermo (IT) - The overlap relation in constructive mathematics - (CMPC 2010) 19/25
22 Towards a new kind of completion The case of a Boolean algebra (classically). The Dedekind-MacNeille completion DMN(S) of a poset (S, ) can be presented as the complete lattice of all formal open subsets associated to a (basic) cover relation on S, namely: a U def ( b S) ( ( u U)(u b) a b ). If S is a Boolean algebra AND we adopt a classical metalanguage, then: a U ( b S) ( ( u U)(u b) a b ) ( b S) ( ( u U)(u b = 0) a b = 0 ) ( b S) ( a b 0 }{{} a><b ( u U)(u b 0) ) }{{} u><b Francesco Ciraulo - Palermo (IT) - The overlap relation in constructive mathematics - (CMPC 2010) 19/25
23 Completion via overlap (I) In any poset with overlap: a DMN U def ( b S) ( a >< b ( u U)(u >< b) ) Accidentally (!?), this is the (basic) cover represented by the basic pair (S, ><, S). Francesco Ciraulo - Palermo (IT) - The overlap relation in constructive mathematics - (CMPC 2010) 20/25
24 Completion via overlap (I) In any poset with overlap: a DMN U def ( b S) ( a >< b ( u U)(u >< b) ) Accidentally (!?), this is the (basic) cover represented by the basic pair (S, ><, S). If S is already complete: a DMN U ( b S)` a >< b ( u U)(u >< b) {z } ( W U)><b {z } a W U Francesco Ciraulo - Palermo (IT) - The overlap relation in constructive mathematics - (CMPC 2010) 20/25
25 Completion via overlap (II) DMN(S) : usual Dedekind-MacNeille completion. DMN >< (S) : completion via overlap. When S is a Boolean algebra: 1 DMN(S) is a complete Boolean algebra; (actually, the least cba which contains S) 2 DMN >< (S) is an overlap algebra; (actually, the least o-algebra which contains S) 4 4 (w.r.t. a suitable notion of morphism) Francesco Ciraulo - Palermo (IT) - The overlap relation in constructive mathematics - (CMPC 2010) 21/25
26 Completion via overlap (III) For any poset with overlap: 1 DMN >< (S) is an overlap algebra; 2 there exists an embedding S DMN(S) which preserves all existing joins (and meets); 3 DMN >< (S) embeds in any other o-algebra satisfying 2. Classically: the completion via overlap of a poset with overlap is always a cba! Actually, DMC(S) DMN ><(S). Francesco Ciraulo - Palermo (IT) - The overlap relation in constructive mathematics - (CMPC 2010) 22/25
27 Future work Spatial o-algebras & Discrete locales Completions via overlap Inductive-Coinductive generation 5 5 For inductively generated formal topologies, a positivity relation, hence the positivity predicate Pos, can be defined co-inductively. This suggests that the overlap relation >< can probably be defined by co-induction every time is defined by induction. Francesco Ciraulo - Palermo (IT) - The overlap relation in constructive mathematics - (CMPC 2010) 23/25
28 References G. Sambin, The Basic Picture: Structures for Constructive Topology, Oxford University Press, to appear. F. C., G. Sambin, The overlap algebra of regular opens, J. Pure Appl. Algebra 214 (11), pp (November 2010). F. C., Regular opens in Formal Topology and a representation theorem for overlap algebras, submitted. F. C., M. E. Maietti, P. Toto, Constructive version of Boolean algebra, submitted. Francesco Ciraulo - Palermo (IT) - The overlap relation in constructive mathematics - (CMPC 2010) 24/25
29 Thank you! Francesco Ciraulo - Palermo (IT) - The overlap relation in constructive mathematics - (CMPC 2010) 25/25
Constructive version of Boolean algebra
Constructive version of Boolean algebra Francesco Ciraulo, Maria Emilia Maietti, Paola Toto Abstract The notion of overlap algebra introduced by G. Sambin provides a constructive version of complete Boolean
More informationBinary positivity in the language of locales
Binary positivity in the language of locales Francesco Ciraulo Department of Mathematics University of Padua 4 th Workshop on Formal Topology June 15-20 2012, Ljubljana Francesco Ciraulo (Padua) Binary
More informationConstructive version of Boolean algebra
Constructive version of Boolean algebra Francesco Ciraulo, Maria Emilia Maietti, Paola Toto Abstract The notion of overlap algebra introduced by G. Sambin provides a constructive version of complete Boolean
More informationThe overlap algebra of regular opens
The overlap algebra of regular opens Francesco Ciraulo Giovanni Sambin Abstract Overlap algebras are complete lattices enriched with an extra primitive relation, called overlap. The new notion of overlap
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 informationCompletions of Ordered Algebraic Structures A Survey
Completions of Ordered Algebraic Structures A Survey John Harding New Mexico State University www.math.nmsu.edu/johnharding.html jharding@nmsu.edu UncLog-2008 JAIST, March 2008 This is a survey of results
More informationThe space of located subsets
The space of located subsets Tatsuji Kawai Universtà di Padova Second CORE meeting, 27 January 2017, LMU 1 / 26 The space of located subsets We are interested in a point-free topology on the located subsets
More informationLattice Theory Lecture 5. Completions
Lattice Theory Lecture 5 Completions John Harding New Mexico State University www.math.nmsu.edu/ JohnHarding.html jharding@nmsu.edu Toulouse, July 2017 Completions Definition A completion of a poset P
More informationA bitopological point-free approach to compactifications
A bitopological point-free approach to compactifications Olaf Karl Klinke a, Achim Jung a, M. Andrew Moshier b a School of Computer Science University of Birmingham Birmingham, B15 2TT England b School
More informationarxiv: v1 [math.lo] 23 Jul 2009
arxiv:0907.4134v1 [math.lo] 23 Jul 2009 On some peculiar aspects of the constructive theory of point-free spaces Giovanni Curi Dipartimento di Informatica - Università di Verona Strada le Grazie 15-37134
More informationRELATION ALGEBRAS. Roger D. MADDUX. Department of Mathematics Iowa State University Ames, Iowa USA ELSEVIER
RELATION ALGEBRAS Roger D. MADDUX Department of Mathematics Iowa State University Ames, Iowa 50011 USA ELSEVIER AMSTERDAM. BOSTON HEIDELBERG LONDON NEW YORK. OXFORD PARIS SAN DIEGO. SAN FRANCISCO. SINGAPORE.
More informationRelations on Hypergraphs
Relations on Hypergraphs John Stell School of Computing, University of Leeds RAMiCS 13 Cambridge, 17th September 2012 Relations on a Set Boolean algebra Converse R = R Complement R = R Composition & residuation
More informationOn injective constructions of S-semigroups. Jan Paseka Masaryk University
On injective constructions of S-semigroups Jan Paseka Masaryk University Joint work with Xia Zhang South China Normal University BLAST 2018 University of Denver, Denver, USA Jan Paseka (MU) 10. 8. 2018
More informationHouston Journal of Mathematics. c 2004 University of Houston Volume 30, No. 4, 2004
Houston Journal of Mathematics c 2004 University of Houston Volume 30, No. 4, 2004 MACNEILLE COMPLETIONS OF HEYTING ALGEBRAS JOHN HARDING AND GURAM BEZHANISHVILI Communicated by Klaus Kaiser Abstract.
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 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 Relation Reflection Scheme
The Relation Reflection Scheme Peter Aczel petera@cs.man.ac.uk Schools of Mathematics and Computer Science The University of Manchester September 14, 2007 1 Introduction In this paper we introduce a new
More informationDistributive residuated frames and generalized bunched implication algebras
Distributive residuated frames and generalized bunched implication algebras Nikolaos Galatos and Peter Jipsen Abstract. We show that all extensions of the (non-associative) Gentzen system for distributive
More informationA VIEW OF CANONICAL EXTENSION
A VIEW OF CANONICAL EXTENSION MAI GEHRKE AND JACOB VOSMAER Abstract. This is a short survey illustrating some of the essential aspects of the theory of canonical extensions. In addition some topological
More informationA topological duality for posets
A topological duality for posets RAMON JANSANA Universitat de Barcelona join work with Luciano González TACL 2015 Ischia, June 26, 2015. R. Jansana 1 / 20 Introduction In 2014 M. A. Moshier and P. Jipsen
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 informationcse371/mat371 LOGIC Professor Anita Wasilewska Fall 2018
cse371/mat371 LOGIC Professor Anita Wasilewska Fall 2018 Chapter 7 Introduction to Intuitionistic and Modal Logics CHAPTER 7 SLIDES Slides Set 1 Chapter 7 Introduction to Intuitionistic and Modal Logics
More informationUNITARY UNIFICATION OF S5 MODAL LOGIC AND ITS EXTENSIONS
Bulletin of the Section of Logic Volume 32:1/2 (2003), pp. 19 26 Wojciech Dzik UNITARY UNIFICATION OF S5 MODAL LOGIC AND ITS EXTENSIONS Abstract It is shown that all extensions of S5 modal logic, both
More informationDuality and Automata Theory
Duality and Automata Theory Mai Gehrke Université Paris VII and CNRS Joint work with Serge Grigorieff and Jean-Éric Pin Elements of automata theory A finite automaton a 1 2 b b a 3 a, b The states are
More informationA fresh perspective on canonical extensions for bounded lattices
A fresh perspective on canonical extensions for bounded lattices Mathematical Institute, University of Oxford Department of Mathematics, Matej Bel University Second International Conference on Order, Algebra
More informationCanonical extensions and the intermediate structure
Canonical extensions and the intermediate structure Andrew Craig Mathematical Institute, Oxford University Workshop on Lattices, Relations and Kleene Algebras UCL 21 September 2010 Let L be a lattice and
More informationA Discrete Duality Between Nonmonotonic Consequence Relations and Convex Geometries
A Discrete Duality Between Nonmonotonic Consequence Relations and Convex Geometries Johannes Marti and Riccardo Pinosio Draft from April 5, 2018 Abstract In this paper we present a duality between nonmonotonic
More informationSets and Motivation for Boolean algebra
SET THEORY Basic concepts Notations Subset Algebra of sets The power set Ordered pairs and Cartesian product Relations on sets Types of relations and their properties Relational matrix and the graph of
More informationProving simple set properties...
Proving simple set properties... Part 1: Some examples of proofs over sets Fall 2013 Proving simple set properties... Fall 2013 1 / 17 Introduction Overview: Learning outcomes In this session we will...
More informationRelational semantics for a fragment of linear logic
Relational semantics for a fragment of linear logic Dion Coumans March 4, 2011 Abstract Relational semantics, given by Kripke frames, play an essential role in the study of modal and intuitionistic logic.
More informationAn Introduction to the Theory of Lattice
An Introduction to the Theory of Lattice Jinfang Wang Λy Graduate School of Science and Technology, Chiba University 1-33 Yayoi-cho, Inage-ku, Chiba 263-8522, Japan May 11, 2006 Λ Fax: 81-43-290-3663.
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 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 informationIntroduction to generalized topological spaces
@ Applied General Topology c Universidad Politécnica de Valencia Volume 12, no. 1, 2011 pp. 49-66 Introduction to generalized topological spaces Irina Zvina Abstract We introduce the notion of generalized
More informationJOIN-COMPLETIONS OF ORDERED ALGEBRAS
JOIN-COMPLETIONS OF ORDERED ALGEBRAS JOSÉ GIL-FÉREZ, LUCA SPADA, CONSTANTINE TSINAKIS, AND HONGJUN ZHOU Abstract. We present a systematic study of join-extensions and joincompletions of ordered algebras,
More informationAlgebraic duality for partially ordered sets
arxiv:math/0002025v1 [math.ct] 3 Feb 2000 Algebraic duality for partially ordered sets Roman R. Zapatrin Department of Mathematics, SPb UEF, Griboyedova 30/32, 191023, St-Petersburg, Russia and Division
More informationThe Zariski Spectrum of a ring
Thierry Coquand September 2010 Use of prime ideals Let R be a ring. We say that a 0,..., a n is unimodular iff a 0,..., a n = 1 We say that Σa i X i is primitive iff a 0,..., a n is unimodular Theorem:
More informationSPECTRAL-LIKE DUALITY FOR DISTRIBUTIVE HILBERT ALGEBRAS WITH INFIMUM
SPECTRAL-LIKE DUALITY FOR DISTRIBUTIVE HILBERT ALGEBRAS WITH INFIMUM SERGIO A. CELANI AND MARÍA ESTEBAN Abstract. Distributive Hilbert Algebras with infimum, or DH -algebras, are algebras with implication
More informationarxiv:math/ v1 [math.lo] 5 Mar 2007
Topological Semantics and Decidability Dmitry Sustretov arxiv:math/0703106v1 [math.lo] 5 Mar 2007 March 6, 2008 Abstract It is well-known that the basic modal logic of all topological spaces is S4. However,
More information11 Annihilators. Suppose that R, S, and T are rings, that R P S, S Q T, and R U T are bimodules, and finally, that
11 Annihilators. In this Section we take a brief look at the important notion of annihilators. Although we shall use these in only very limited contexts, we will give a fairly general initial treatment,
More informationUniversity of Oxford, Michaelis November 16, Categorical Semantics and Topos Theory Homotopy type theor
Categorical Semantics and Topos Theory Homotopy type theory Seminar University of Oxford, Michaelis 2011 November 16, 2011 References Johnstone, P.T.: Sketches of an Elephant. A Topos-Theory Compendium.
More informationComparing intuitionistic quantum logics
Comparing intuitionistic quantum logics From orthomodular lattices to frames Dan Marsden August 31, 2010 Abstract The aim of this dissertation is to explore two different forms of intuitionistic quantum
More informationA duality-theoretic approach to MTL-algebras
A duality-theoretic approach to MTL-algebras Sara Ugolini (Joint work with W. Fussner) BLAST 2018 - Denver, August 6th 2018 A commutative, integral residuated lattice, or CIRL, is a structure A = (A,,,,,
More informationBoolean Algebras, Boolean Rings and Stone s Representation Theorem
Boolean Algebras, Boolean Rings and Stone s Representation Theorem Hongtaek Jung December 27, 2017 Abstract This is a part of a supplementary note for a Logic and Set Theory course. The main goal is to
More informationThe Logic of Partitions with an application to Information Theory
1 The Logic of Partitions with an application to Information Theory David Ellerman University of California at Riverside and WWW.Ellerman.org 2 Outline of Talk Logic of partitions dual to ordinary logic
More informationCHAPTER 11. Introduction to Intuitionistic Logic
CHAPTER 11 Introduction to Intuitionistic Logic Intuitionistic logic has developed as a result of certain philosophical views on the foundation of mathematics, known as intuitionism. Intuitionism was originated
More informationAn algebraic approach to Gelfand Duality
An algebraic approach to Gelfand Duality Guram Bezhanishvili New Mexico State University Joint work with Patrick J Morandi and Bruce Olberding Stone = zero-dimensional compact Hausdorff spaces and continuous
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 informationNotes on Ordered Sets
Notes on Ordered Sets Mariusz Wodzicki September 10, 2013 1 Vocabulary 1.1 Definitions Definition 1.1 A binary relation on a set S is said to be a partial order if it is reflexive, x x, weakly antisymmetric,
More informationMONADIC FRAGMENTS OF INTUITIONISTIC CONTROL LOGIC
Bulletin of the Section of Logic Volume 45:3/4 (2016), pp. 143 153 http://dx.doi.org/10.18778/0138-0680.45.3.4.01 Anna Glenszczyk MONADIC FRAGMENTS OF INTUITIONISTIC CONTROL LOGIC Abstract We investigate
More informationExponentiation of unary topologies over inductively generated formal topologies
Exponentiation of unary topologies over inductively generated formal topologies Maria Emilia Maietti - Silvio Valentini Dipartimento di Matematica Pura ed Applicata Università di Padova via G. Belzoni
More informationRESIDUATED FRAMES WITH APPLICATIONS TO DECIDABILITY
RESIDUATED FRAMES WITH APPLICATIONS TO DECIDABILITY NIKOLAOS GALATOS AND PETER JIPSEN Abstract. Residuated frames provide relational semantics for substructural logics and are a natural generalization
More informationMacNeille completions and canonical extensions
MacNeille completions and canonical extensions Mai Gehrke New Mexico State University John Harding New Mexico State University January 29, 2004 Yde Venema University of Amsterdam Abstract Let V be a variety
More informationMath 455 Some notes on Cardinality and Transfinite Induction
Math 455 Some notes on Cardinality and Transfinite Induction (David Ross, UH-Manoa Dept. of Mathematics) 1 Cardinality Recall the following notions: function, relation, one-to-one, onto, on-to-one correspondence,
More informationNumber Axioms. P. Danziger. A Group is a set S together with a binary operation (*) on S, denoted a b such that for all a, b. a b S.
Appendix A Number Axioms P. Danziger 1 Number Axioms 1.1 Groups Definition 1 A Group is a set S together with a binary operation (*) on S, denoted a b such that for all a, b and c S 0. (Closure) 1. (Associativity)
More informationPoint-Free Topology. Erik Palmgren Uppsala University, Dept. of Mathematics
Point-Free Topology Erik Palmgren Uppsala University, Dept. of Mathematics MAP Summer School 2008, International Centre for Theoretical Physics. Trieste, August 11 22, 2008. 1 / 130 Non-constructive aspects
More informationAbstract Interpretation from a Topological Perspective
(-: / 1 Abstract Interpretation from a Topological Perspective David Schmidt Kansas State University www.cis.ksu.edu/ schmidt Motivation and overview of results (-: / 2 (-: / 3 Topology studies convergent
More informationAlgebras with finite descriptions
Algebras with finite descriptions André Nies The University of Auckland July 19, 2005 Part 1: FA-presentability A countable structure in a finite signature is finite-automaton presentable (or automatic)
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 informationCONSTRUCTIVE GELFAND DUALITY FOR C*-ALGEBRAS
CONSTRUCTIVE GELFAND DUALITY FOR C*-ALGEBRAS THIERRY COQUAND COMPUTING SCIENCE DEPARTMENT AT GÖTEBORG UNIVERSITY AND BAS SPITTERS DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE, EINDHOVEN UNIVERSITY OF
More informationarxiv: v1 [cs.lo] 4 Sep 2018
A characterization of the consistent Hoare powerdomains over dcpos Zhongxi Zhang a,, Qingguo Li b, Nan Zhang a a School of Computer and Control Engineering, Yantai University, Yantai, Shandong, 264005,
More informationFrom Residuated Lattices to Boolean Algebras with Operators
From Residuated Lattices to Boolean Algebras with Operators Peter Jipsen School of Computational Sciences and Center of Excellence in Computation, Algebra and Topology (CECAT) Chapman University October
More informationProperties of Boolean Algebras
Phillip James Swansea University December 15, 2008 Plan For Today Boolean Algebras and Order..... Brief Re-cap Order A Boolean algebra is a set A together with the distinguished elements 0 and 1, the binary
More informationANNIHILATOR IDEALS IN ALMOST SEMILATTICE
BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 2303-4874, ISSN (o) 2303-4955 www.imvibl.org /JOURNALS / BULLETIN Vol. 7(2017), 339-352 DOI: 10.7251/BIMVI1702339R Former BULLETIN
More informationIntroduction to Kleene Algebras
Introduction to Kleene Algebras Riccardo Pucella Basic Notions Seminar December 1, 2005 Introduction to Kleene Algebras p.1 Idempotent Semirings An idempotent semiring is a structure S = (S, +,, 1, 0)
More informationComputability of Heyting algebras and. Distributive Lattices
Computability of Heyting algebras and Distributive Lattices Amy Turlington, Ph.D. University of Connecticut, 2010 Distributive lattices are studied from the viewpoint of effective algebra. In particular,
More informationCONTINUITY. 1. Continuity 1.1. Preserving limits and colimits. Suppose that F : J C and R: C D are functors. Consider the limit diagrams.
CONTINUITY Abstract. Continuity, tensor products, complete lattices, the Tarski Fixed Point Theorem, existence of adjoints, Freyd s Adjoint Functor Theorem 1. Continuity 1.1. Preserving limits and colimits.
More informationOn the Truth Values of Fuzzy Statements
International Journal of Applied Computational Science and Mathematics. ISSN 2249-3042 Volume 3, Number 1 (2013), pp. 1-6 Research India Publications http://www.ripublication.com/ijacsm.htm On the Truth
More informationTopological Duality and Algebraic Completions
Topological Duality and Algebraic Completions Mai Gehrke Abstract In this chapter we survey some developments in topological duality theory and the theory of completions for lattices with additional operations
More informationEQUIVALENCE RELATIONS AND OPERATORS ON ORDERED ALGEBRAIC STRUCTURES. UNIVERSITÀ DEGLI STUDI DELL'INSUBRIA Via Ravasi 2, Varese, Italy
UNIVERSITÀ DEGLI STUDI DELL'INSUBRIA Via Ravasi 2, 21100 Varese, Italy Dipartimento di Scienze Teoriche e Applicate Di.S.T.A. Dipartimento di Scienza e Alta Tecnologia Di.S.A.T. PH.D. DEGREE PROGRAM IN
More informationCompletions of Ordered Algebraic Structures: A Survey
Completions of Ordered Algebraic Structures: A Survey John Harding Department of Mathematical Sciences New Mexico State University Las Cruces, NM 88003 E-mail: jharding@nmsu.edu Http://www.math.nmsu.edu/
More informationFormal Topology, Chu Space and Approximable Concept
Formal Topology, Chu Space and Approximable Concept Xueyou Chen Qingguo Li Xueyou Chen 2 and Qingguo Li 1 (College of Mathematics and Economics, Hunan University, 1 College of Chang Mathematics Sha, Hunan
More informationUnification of terms and language expansions
Unification of terms and language expansions in Heyting algebras and commutative residuated lattices Wojciech Dzik Instytut Matematyki Uniwersytet Sl aski, Katowice wojciech.dzik@us.edu.pl joint work with
More informationAxioms of Kleene Algebra
Introduction to Kleene Algebra Lecture 2 CS786 Spring 2004 January 28, 2004 Axioms of Kleene Algebra In this lecture we give the formal definition of a Kleene algebra and derive some basic consequences.
More informationOn Jankov-de Jongh formulas
On Jankov-de Jongh formulas Nick Bezhanishvili Institute for Logic, Language and Computation University of Amsterdam http://www.phil.uu.nl/~bezhanishvili The Heyting day dedicated to Dick de Jongh and
More informationExtending Algebraic Operations to D-Completions
Replace this file with prentcsmacro.sty for your meeting, or with entcsmacro.sty for your meeting. Both can be found at the ENTCS Macro Home Page. Extending Algebraic Operations to D-Completions Klaus
More informationEmbedding theorems for normal divisible residuated lattices
Embedding theorems for normal divisible residuated lattices Chapman University Department of Mathematics and Computer Science Orange, California University of Siena Department of Mathematics and Computer
More informationLecture Notes: Selected Topics in Discrete Structures. Ulf Nilsson
Lecture Notes: Selected Topics in Discrete Structures Ulf Nilsson Dept of Computer and Information Science Linköping University 581 83 Linköping, Sweden ulfni@ida.liu.se 2004-03-09 Contents Chapter 1.
More informationTopos 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 informationExploring the Exotic Setting for Algebraic Geometry
Exploring the Exotic Setting for Algebraic Geometry Victor I. Piercey University of Arizona Integration Workshop Project August 6-10, 2010 1 Introduction In this project, we will describe the basic topology
More informationLocalic completion of generalized metric spaces II: Powerlocales
1 48 ISSN 1759-9008 1 Localic completion of generalized metric spaces II: Powerlocales STEVEN VICKERS Abstract: The work investigates the powerlocales (lower, upper, Vietoris) of localic completions of
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 informationCONFLUENTES MATHEMATICI
CONFLUENTES MATHEMATICI Davide RINALDI, Giovanni SAMBIN, and Peter SCHUSTER The Basic Zariski Topology Tome 7, n o 1 (2015), p 55-81 Les auteurs et Confluentes
More informationPriestley Duality for Bilattices
A. Jung U. Rivieccio Priestley Duality for Bilattices In memoriam Leo Esakia Abstract. We develop a Priestley-style duality theory for different classes of algebras having a bilattice reduct. A similar
More informationA Bimodal Perspective on Possibility Semantics
A Bimodal Perspective on Possibility Semantics Johan van Benthem, Nick Bezhanishvili, and Wesley H. Holliday Institute for Logic, Language and Computation, University of Amsterdam Department of Philosophy,
More informationQualifying Exam Logic August 2005
Instructions: Qualifying Exam Logic August 2005 If you signed up for Computability Theory, do two E and two C problems. If you signed up for Model Theory, do two E and two M problems. If you signed up
More informationJoseph Muscat Universal Algebras. 1 March 2013
Joseph Muscat 2015 1 Universal Algebras 1 Operations joseph.muscat@um.edu.mt 1 March 2013 A universal algebra is a set X with some operations : X n X and relations 1 X m. For example, there may be specific
More informationSemantics of intuitionistic propositional logic
Semantics of intuitionistic propositional logic Erik Palmgren Department of Mathematics, Uppsala University Lecture Notes for Applied Logic, Fall 2009 1 Introduction Intuitionistic logic is a weakening
More informationBoolean Algebras. Chapter 2
Chapter 2 Boolean Algebras Let X be an arbitrary set and let P(X) be the class of all subsets of X (the power set of X). Three natural set-theoretic operations on P(X) are the binary operations of union
More information1.A Sets, Relations, Graphs, and Functions 1.A.1 Set a collection of objects(element) Let A be a set and a be an elements in A, then we write a A.
1.A Sets, Relations, Graphs, and Functions 1.A.1 Set a collection of objects(element) Let A be a set and a be an elements in A, then we write a A. How to specify sets 1. to enumerate all of the elements
More informationDedekind MacNeille Completion of n-ordered Sets
Order (2007) 24:15 29 DOI 10.1007/s11083-007-9055-3 Dedekind MacNeille Completion of n-ordered Sets George Voutsadakis Received: 21 December 2004 / Accepted: 20 February 2007 / Published online: 27 March
More informationON THE CONGRUENCE LATTICE OF A FRAME
PACIFIC JOURNAL OF MATHEMATICS Vol. 130, No. 2,1987 ON THE CONGRUENCE LATTICE OF A FRAME B. BANASCHEWSKI, J. L. FRITH AND C. R. A. GILMOUR Recall that the Skula modification SkX of a topological space
More informationA Duality for Distributive Unimodal Logic
A Duality for Distributive Unimodal Logic Adam Přenosil 1 Institute of Computer Science, Academy of Sciences of the Czech Republic Pod vodárenskou věží 271/2, 182 00 Praha Abstract We introduce distributive
More information8. Prime Factorization and Primary Decompositions
70 Andreas Gathmann 8. Prime Factorization and Primary Decompositions 13 When it comes to actual computations, Euclidean domains (or more generally principal ideal domains) are probably the nicest rings
More informationCongruence Boolean Lifting Property
Congruence Boolean Lifting Property George GEORGESCU and Claudia MUREŞAN University of Bucharest Faculty of Mathematics and Computer Science Academiei 14, RO 010014, Bucharest, Romania Emails: georgescu.capreni@yahoo.com;
More informationInquisitive semantics
Inquisitive semantics NASSLLI 2012 lecture notes Ivano Ciardelli University of Bordeaux Floris Roelofsen University of Amsterdam June 25, 2012 Jeroen Groenendijk University of Amsterdam About this document
More informationBases as Coalgebras. Bart Jacobs
Bases as Coalgebras Bart Jacobs Institute for Computing and Information Sciences (icis), Radboud University Nijmegen, The Netherlands. Webaddress: www.cs.ru.nl/b.jacobs Abstract. The free algebra adjunction,
More informationModal logic and the Vietoris functor
Modal logic and the Vietoris functor Yde Venema and Jacob Vosmaer Dedicated to the memory of Leo Esakia, who was and will remain a great source of inspiration, both as a logician and as a person Abstract
More informationA NEW CHARACTERIZATION OF COMPLETE HEYTING AND CO-HEYTING ALGEBRAS
Logical Methods in Computer Science Vol. 13(3:252017, pp. 1 11 www.lmcs-online.org Submitted Apr. 15, 2015 Published Sep. 14, 2017 A NEW CHARACTERIZATION OF COMPLETE HEYTING AND CO-HEYTING ALGEBRAS FRANCESCO
More informationCosheaves and connectedness in formal topology
Cosheaves and connectedness in formal topology Steven Vickers School of Computer Science, University of Birmingham, Birmingham, B15 2TT, UK s.j.vickers@cs.bham.ac.uk July 25, 2013 Abstract The localic
More information