Mckinsey Algebras and Topological Models of S4.1

Total Page:16

File Type:pdf, Size:1020Kb

Mckinsey Algebras and Topological Models of S4.1 McKinsey Algebras and Topological Models of S4.1 Thomas Mormann Abstract. The aim of this paper is to show that every topological space gives rise to a wealth of topological models of the modal logic S4.1. The construction of these models is based on the fact that every topological space defines a Boolean closure algebra (to be called a McKinsey algebra) that neatly reflects the structure of the modal system S4.1 in that all its elements satisfy the topological interpretation of the McKinsey axiom. It is shown that the class of topological models based on McKinsey algebras contains a canonical model that can be used to prove a completeness theorem for S4.1. Finally, it is proved that the McKinsey algebra MKX of a space X endowed with an α-topology satisfies Esakia’s GRZ axiom. Keywords. McKinsey Axiom Schema, Modal Logic, Topological Models of S4, S4.1, Boun- dary, Closure Algebra, Completeness. 1. Introduction. Let S4.1 be the propositional modal logic over S4 defined by adding the so called McKinsey axiom (schema) (1.1) ϕ → ϕ to the axioms and rules of S4. Let (X, τ) be a topological space with closure operator cl and interior operator int (cf. Kuratowski and Mostowski (1976), Willard (2004)). Inter- preting the modal operators and by the topological operators int and cl in the familiar way, the McKinsey axiom defines the following subset MKX of the power set PX of X: (1.2) MKX := {a; intcl(a) ⊆ clint(a), a ⊆ X} In view of (1.1) I propose to call the elements of MKX as McKinsey sets. The power set PX of a topological space X has the structure of a complete interior Boolean algebra (PX, ⊆, Ø, X, int) or, equivalently, the structure of a complete closure algebra (PX, ⊆, Ø, X, cl). Throughout this paper PX is assumed to carry this structure of a modal Boolean algebra. It is natural to ask then how the subset MKX of PX behaves with respect to this structure. The main technical result of this paper is the following theorem: (1.3) Theorem. Let (X, τ) be a topological space. The set MKX is a Boolean subalgebra of the Boolean algebra PX. More precisely, MKX is a modal subalgebra of PX. The modal algebra MKX is to be called the McKinsey algebra of the topological space X. The elements of MKX are referred to as McKinsey sets.♦1 The following remarks on (1.3) may be in order: (i) Let OX and CX denote the sets of open and of closed sets of a topological space (X, τ), respectively. Then OX ∪ CX ⊆ MKX: For a ∈ OX this is proved as follows. From a = int(a) one obtains and intcl(a) = intclint(a) ⊆ clint(a) by the fundamental properties of the interior operator int. Hence a ∈ MKX. The assertion for CX is proved similarly. As will be shown later MKX not only contains open and closed sets but also all kinds of „mixed“ sets, in particular finite intersections and unions of open and closed sets and nowhere dense sets. In a sense MKX may be considered as a „finite“ counterpart or analogue of the σ-complete Boolean algebra BOX of Borel sets of X. This is nicely evidenced by Theorem (2.4), to be proved in section 4 according to which certain quotients of MKX and BOX, respectively, are isomorphic Boolean algebras. Nevertheless MKX and BOX are clearly different: Neither MKX is a subset of BOX, nor is BOX a subset of MKX. (ii) A particularly important role for the structure of MKX is played by the ideal NDX of nowhere dense sets. Recall that a subset a of a topological space is called nowhere dense if and only if intcl(a) = Ø. One immediately observes that NDX ⊆ MKX since by definition one has Ø = intcl a ⊆ clint a = Ø. As will be shown later, OX and NDX generate MKX as a Boolean algebra in a precise sense. 1 Stone (1937) seems to have been the first paper where MKX showed up (not under this name of course). Stone called it the „complete basic ring of the topological space X“ and proved some of ist the basic properties of McKinsey sets (cf. Theorem 24). Much later, Esakia (2004) mentions as a „key observation“ that the subset {a ∈ B; intcla ≤ clinta} of a Boolean closure algebra B is also a Boolean closure algebra (cf. Esakia (2004, section 8.4). He explicitly mentioned the McKinsey axiom but seems to be unaware of the fact that already Stone made the just mentioned „key observation“. Independently of Stone, McKinsey, and Esakia, the set MKX was mentioned by several topologists who dubbed the „McKinsey sets“ of this paper „delta sets“, „NDB sets (= sets with nowhere dense boundary), or „α-open sets“. These authors, however, never noticed that these sets played a role in modal logic, nor realized that MKX is a Boolean algebra. 2 (iii) In general MKX is a proper subalgebra of PX as is shown by the following canonical example: Consider the real line R endowed with its standard Euclidean topology. Then one obtains for the set Q of rational numbers (1.4) intcl(Q) = R and clint(Q) = Ø. Hence Q is not an element of MKR. This proves that in general MKX ≠ PX. Since every singleton {r}, r ∈ R, is clearly a McKinsey set, the set Q as a countable union of rational numbers evidences that MKX in general is not a σ-complete Boolean algebra. On the other hand it is well known that there are topological spaces X for which PX = MKX, i.e., every subset a of X is a McKinsey set (cf. Bezhanishvili, Esakia, Gabelaia (2005), van Benthem, Bezhanishvili (2007, Chapter 5, p. 253).2 The main aim of this paper is to use the modal algebra MKX to define a profusion of sound topological models of S4.1 and related logics. Among these models there is also a canonical complete model that allows us to prove a completeness theorem for S4.1. The outline of this paper is as follows. In the next section we explore the lattice-theoretical context in which MKX is embedded. That is to say, we study in some detail the various topologically defined lattices to which MKX is related. This prepares the ground for proving (1.2) in the following section, exploiting a formula of A.H. Stone mentioned. Then we show that McKinsey algebras may be used to construct sound topological models of S4.1. Among these topological models for S4.1 there is a canonical model endowed with a canonical interpretation. This enables us to prove a completeness for S4.1 following the lines of the elegant completeness proof for S4 presented by Aiello, van Benthem, Bezha- nishvili (2003)). 2. McKinsey algebras and other lattices of topological spaces. The algebra MKX is in no way the only lattice that is related with a topological space (X, τ). On the contrary, MKX may be considered as an almost completely neglected member of an extended family of lattice structures that can be associated to any topological space X. For later use, some of them are collected in the following list: 2 Bezhanishvili, Esakia, Gabelaia (2005) proposed to call a topological space X a McKinsey space if the set of dense subsets of X forms a filter (ibid., p. 326). They showed that for McKinsey spaces the algebras MKX and PX coincide, i.e., all subsets of a X satisfy the requirement intcl(a) ⊆ clint(a). Hence calling MKX the McKinsey algebra of X is quite in line with this usage. 3 (2.1) Definition. Let (X, τ) be a topological space. The topological structure on X gives rise to (at least) the following lattices: (1) PX := modal Boolean algebra of subsets of X. (2) OX = Heyting algebra of open sets. (3) CX = Co-Heyting algebra of closed sets. (4) ROX = Boolean algebra of regular open sets. (5) RCX = Boolean algebra of regular closed sets. (6) CLX = Boolean algebra of clopen sets. (7) BOX = Boolean algebra of Borel sets. (8) MKX = modal Boolean algebra of McKinsey sets (with closure operator cl).♦ The general aim of this paper is to show that for virtually all considerations of modal logic the modal algebra (PX, ⊆, cl) can be replaced by the smaller modal algebra (MKX, ⊆, cl). As an extra bonus of this replacement one obtains an easy completeness theorem for S4.1 instead of S4. The following inclusion relations between these lattices listed in (2.1) are well-known: (2.2) Proposition: Let (X, τ) be a topological space. Then the following inclusion relations (as inclusions of order structures) between the lattices defined above hold. ROX ⊆ OX MKX CLOX ⊆ ⊆ ⊆ PX.♦ RCX ⊆ CX BOX3 Recall that a subset a of a topological space X is meager if and only if a is the countable union of nowhere dense sets. The set of meager sets is denoted by MGX. MGX is well- known to be an ideal of BOX. In Halmos (1963) the following somewhat surprising relation between the Boolean algebras ROX, and BOX is proved (cf. Halmos 1963, § 13, Theorem 4, p. 58): 3 In general, MKX is not a subset of BOX, nor is BOX a subset of MKX. Already in (1.3) it was pointed out that the set Q of rational numbers is a Borel set but not a McKinsey set. In order to show that in general MKX is not a subset of BOX one may argue as follows. As is well-known the Cantor set C is a closed nowhere dense set of R.
Recommended publications
  • Willem Blok and Modal Logic M
    W. Rautenberg F. Wolter Willem Blok and modal logic M. Zakharyaschev Abstract. We present our personal view on W.J. Blok’s contribution to modal logic. Introduction Willem Johannes Blok started his scientific career in 1973 as an algebraist with an investigation of varieties of interior (a.k.a. closure or topological Boolean or topoboolean) algebras. In the years following his PhD in 1976 he moved on to study more general varieties of modal algebras (and matrices) and, by the end of the 1970s, this algebraist was recognised by the modal logic community as one of the most influential modal logicians. Wim Blok worked on modal algebras till about 1979–80, and over those seven years he obtained a number of very beautiful and profound results that had and still have a great impact on the development of the whole discipline of modal logic. In this short note we discuss only three areas of modal logic where Wim Blok’s contribution was, in our opinion, the most significant: 1. splittings of the lattice of normal modal logics and the position of Kripke incomplete logics in this lattice [3, 4, 6], 2. the relation between modal logics containing S4 and extensions of intuitionistic propositional logic [1], 3. the position of tabular, pretabular, and locally tabular logics in lattices of modal logics [1, 6, 8, 10]. As usual in mathematics and logic, it is not only the results themselves that matter, but also the power and beauty of the methods developed to obtain them. In this respect, one of the most important achievements of Wim Blok was a brilliant demonstration of the fact that various techniques and results that originated in universal algebra can be used to prove significant and deep theorems in modal logic.
    [Show full text]
  • Semisimplicity, Glivenko Theorems, and the Excluded Middle
    Semisimplicity, Glivenko theorems, and the excluded middle Adam Pˇrenosil (joint work with Tomáš Láviˇcka) Vanderbilt University, Nashville, USA Online Logic Seminar 29 October 2020 1 / 40 Introduction Semisimplicity is equivalent to the law of the excluded middle (LEM). The semisimple companion and the Glivenko companion of a logic coincide. for compact propositional logics with a well-behaved negation. 2 / 40 Intuitionistic and classical logic How can we obtain classical propositional logic from intuitionistic logic? 1. Classical logic is intuitionistic logic plus the LEM (the axiom ' '). _: 2. Classical consequence is related to intuitionistic consequence through the Glivenko translation (the double negation translation): Γ CL ' Γ IL '. ` () ` :: In other words, CL is the Glivenko companion of IL. 3. The algebraic models of classical logic (Boolean algebras) are precisely the semisimple models of intuitionistic logic (Heyting algebras). In other words, CL is the semisimple companion of IL. 3 / 40 Modal logic S4 and S5 How can we obtain the global modal logic S5 (modal logic of equivalence relations) from the global modal logic S4 (modal logic of preorders)? 1. Modal logic S5 is modal logic S4 plus the axiom ' '. _ : This is just the LEM with disjunction x y and negation x. _ : 2. Consequence in S5 is related to consequence in S4 through the Glivenko translation (the double negation translation): Γ S5 ' Γ S4 '. ` () ` : : This is just the Glivenko translation with negation x. : 3. The algebraic models of S5 are precisely the semisimple models of S4 (Boolean algebras with a topological interior operator). 4 / 40 Semisimplicity: algebraic definition Each algebra A has a lattice of congruences Con A.
    [Show full text]
  • Interior Algebras
    VARIETIES OF INTERIOR ALGEBRAS bv w. J. BLOK $@@>@ Abstract Westudy (generalized) Boolean algebras endowedwith an interior operator, called (generalized) interior algebras. Particular attention is paid to the structure of the free (generalized) interior algebra on a finite numberof generators. Free objects in somevarieties of (generalized) interior algebras are determined. Using methods of a universal algebraic nature we investigate the lattice of varieties of interior algebras. Keywords:(generalized) interior algebra, Heyting algebra, free algebra, *ra1gebra, lattice of varieties, splitting algebra. AMSMOS70 classification: primary 02 J 05, 06 A 75 secondary 02 C 10, 08 A 15. Dvuk:HuisdrukkerijUniversiteitvanAmsterdam T _ VARIETIES OF INTERIOR ALGEBRAS ACADEMISCH PROEFSCHRIFT TER VERKRIJGING VAN DE GRAAD VAN DOCTOR IN DE WISKUNDE EN NATUURWETENSCHAPPEN AAN DE UNIVERSITEIT VAN AMSTERDAM OP GEZAG VAN DE RECTOR MAGNIFICUS DR G. DEN BOEF HOOGLERAAR IN DE FACULTEIT DER WISKUNDE EN NATUURWETENSCHAPPEN IN HET OPENBAAR TE VERDEDIGEN IN DE AULA DER UNIVERSITEIT (TIJDELIJK IN DE LUTHERSE KERK, INGANG SINGEL 4!], HOEK SPUI) OP WOENSDAG 3 NOVEMBER 1976 DES NAMIDDAGS TE 4 UUR DOOR WILLEM JOHANNES BLOK GEBOREN TE HOORN Promotor : Prof. Dr. Ph.Dwinger Coreferent: Prof. Dr. A.S.Troe1stra Druk: Huisdrukkerii Universiteit van Amsterdam T ./ I-‘£670 aan mijn oude/Us (U171 /LQVLQQ Acknowledgements I ammuch indebted to the late prof. J. de Groot, the contact with whomhas meant a great deal to me. The origin of this dissertation lies in Chicago, during mystay at the University of Illinois at ChicagoCircle in the year '73 - '74. I want to express myfeelings of gratitude to all persons whocontri­ buted to making this stay as pleasant and succesful as I experienced it, in particular to prof.
    [Show full text]
  • Topological Semantics for Paraconsistent and Paracomplete Logics
    Topological semantics for paraconsistent and paracomplete logics David Fuenmayor February 23, 2021 Abstract We introduce a generalized topological semantics for paraconsistent and paracomplete logics by drawing upon early works on topological Boolean algebras (cf. works by Kuratowski, Zarycki, McKinsey & Tarski, etc.). In particular, this work exemplarily illustrates the shallow semantical embeddings approach (SSE) employing the proof assistant Isabelle/HOL. By means of the SSE technique we can effectively harness theorem provers, model finders and ‘hammers’ for reasoning with quantified non-classical logics. Contents 1 Shallow embedding of a Boolean algebra of propositions 3 1.1 Encoding Boolean operations ............................. 4 1.2 Second-order operations and fixed-points ....................... 4 1.3 Equality and atomicity ................................. 5 1.4 Obtaining a complete Boolean Algebra ........................ 6 1.5 Adding quantifiers (restricted and unrestricted) ................... 6 1.6 Relating quantifiers with further operators ...................... 7 2 Positive semantic conditions for operations 8 2.1 Definitions (finitary case) ............................... 9 2.2 Relations among conditions (finitary case) ...................... 9 2.3 Definitions (infinitary case) .............................. 10 2.4 Relations among conditions (infinitary case) ..................... 10 2.5 Exploring the Barcan formula and its converse ................... 10 3 Negative semantic conditions for operations 11 3.1 Definitions
    [Show full text]
  • Fregean Subtractive Varieties with Definable Congruence
    J. Austral. Math. Soc. 71 (2001), 353-366 FREGEAN SUBTRACTIVE VARIETIES WITH DEFINABLE CONGRUENCE PAOLO AGLIANO (Received 24 February 1999; revised 21 September 2000) Communicated by B. A. Davey Abstract In this paper we investigate subtractive varieties of algebras that are Fregean in order to get structure theorems about them. For instance it turns out that a subtractive variety is Fregean and has equationally definable principal congruences if and only if it is termwise equivalent to a variety of Hilbert algebras with compatible operations. Several examples are provided to illustrate the theory. 2000 Mathematics subject classification: primary 08A99,08A3O. Keywords and phrases: Fregean, subtractive variety, definable congruences. 1. Introduction A few words on general notation. If A is an algebra, then 1A and 0A always denote the largest and the smallest congruence on A. If X c A2, then ft^iX) is the smallest congruence containing all pairs in X. If X = {a, b], we write fi\{a, b). Finally, if Y c A, SubA(F) is the smallest subalgebra of A containing Y. The idea of distinguishing between Fregean and non-Fregean logics is mainly due to Roman Suszko and it originates with a proposal for formalizing the logical system of Wittgenstein's Tractatus. The main feature of a non-Fregean logic is the distinction made between denotation of a sentence and its truth value. This distinction, in Suszko's work, was embodied by a new binary connective called identity. Connecting two sentences via the identity connective expresses the fact that they refer to the same thing (that is, they are 'identical'), while the ordinary equivalence connective expresses merely the fact that they have the same truth value.
    [Show full text]
  • A Logical and Algebraic Characterization of Adjunctions Between Generalized Quasi-Varieties
    A LOGICAL AND ALGEBRAIC CHARACTERIZATION OF ADJUNCTIONS BETWEEN GENERALIZED QUASI-VARIETIES TOMMASO MORASCHINI Abstract. We present a logical and algebraic description of right adjoint functors between generalized quasi-varieties, inspired by the work of McKenzie on category equivalence. This result is achieved by developing a correspondence between the concept of adjunction and a new notion of translation between relative equational consequences. The aim of the paper is to describe a logical and algebraic characterization of adjunctions between generalized quasi-varieties.1 This characterization is achieved by developing a correspondence between the concept of adjunction and a new notion of translation, called contextual translation, between equational consequences relative to classes of algebras. More precisely, given two generalized quasi-varieties K and K0, every contextual translation of the equational consequence relative to K into the one relative to K0 corresponds to a right adjoint functor from K0 to K and vice-versa (Theorems 3.5 and 4.3). In a slogan, contextual translations between relative equational consequences are the duals of right adjoint functors. Examples of this correspondence abound in the literature, e.g., Godel’s¨ translation of intuitionistic logic into the modal system S4 corresponds to the functor that extracts the Heyting algebra of open elements from an interior algebra (Examples 3.3 and 3.6), and Kolmogorov’s translation of classical logic into intuitionistic logic corresponds to the functor that extracts the Boolean algebra of regular elements out of a Heyting algebra (Examples 3.4 and 3.6). The algebraic aspect of our characterization of adjunctions is inspired by the work of McKenzie on category equivalences [24].
    [Show full text]
  • Modal Logics of Subsets of the Real Line
    Topological Semantics of Modal Logic David Gabelaia TACL’2011 - Marseille, July 26, 2011. Overview • Personal story • Three gracious ladies • Completeness in C-semantics – Quasiorders as topologies – Finite connected spaces are interior images of the real line – Connected logics • Completeness in d-semantics – Incompleteness – Ordinal completeness of GL – Completeness techniques for wK4 and K4.Grz Motivations • Gödel’s translation – Bringing intuitionistic reasoning into theclassical setting. • Tarski’s impetus towards “algebraization” – Algebra of Topology, McKinsey and Tarski, 1944. • Quine’s criticism – Making Modal Logic meaningful in the rest of mathematics Three Graces Topological space (X,) TACL’2011 - Marseille, July 26, 2011. Three Graces Topological space (X,) Heyting Algebra Op(X) Closure Algebra Derivative Algebra ((X), C) ((X), d) TACL’2011 - Marseille, July 26, 2011. Three Graces Topological space (X,) Hegemone Heyting Algebra Op(X) Delia Cleta Closure Algebra Derivative Algebra ((X), C) ((X), d) TACL’2011 - Marseille, July 26, 2011. The discourses of the Graces • Hegemone talks about open subsets. U(U V) V TACL’2011 - Marseille, July 26, 2011. The discourses of the Graces • Hegemone talks about open subsets. U(U V) V • Cleta can talk about everything Hegemone can: IA I (-IA IB) IB – and more: • A CB subset B is “dense over” A • CA CB = subsets A and B are “apart” TACL’2011 - Marseille, July 26, 2011. The discourses of the Graces • Hegemone talks about open subsets. U(U V) V • Cleta can talk about everything Hegemone can: IA I (-IA IB) IB – and more: • A CB subset B is “dense over” A • CA CB = subsets A and B are “apart” • Delia can talk about everything Cleta can: A dA = CA – and more: A dA A is dense-in-itself (dii) TACL’2011 - Marseille, July 26, 2011.
    [Show full text]
  • Topology and Measure in Logics for Region-Based Theories of Space
    Annals of Pure and Applied Logic 169 (2018) 277–311 Contents lists available at ScienceDirect Annals of Pure and Applied Logic www.elsevier.com/locate/apal Topology and measure in logics for region-based theories of space Tamar Lando Columbia University, Department of Philosophy, 708 Philosophy Hall, 1150 Amsterdam Avenue, Mail Code: 4971, New York, NY 10027, United States a r t i c l e i n f o a b s t r a c t Article history: Space, as we typically represent it in mathematics and physics, is composed of Received 24 May 2017 dimensionless, indivisible points. On an alternative, region-based approach to space, Received in revised form 21 extended regions together with the relations of ‘parthood’ and ‘contact’ are taken November 2017 as primitive; points are represented as mathematical abstractions from regions. Accepted 1 December 2017 Region-based theories of space have been traditionally modeled in regular closed (or Available online 3 January 2018 regular open) algebras, in work that goes back to [5] and [21]. Recently, logics for MSC: region-based theories of space were developed in [3] and [19]. It was shown that these 03B45 logics have both a nice topological and relational semantics, and that the minimal Lcont 03B10 logic for contact algebras, min (defined below), is complete for both. 06E25 Lcont The present paper explores the question of completeness of min and its extensions 54C10 for individual topological spaces of interest: the real line, Cantor space, the rationals, and the infinite binary tree. A second aim is to study a different, algebraic model Keywords: of logics for region-based theories of space, based on the Lebesgue measure algebra Region-based theories of space (or algebra of Borel subsets of the real line modulo sets of Lebesgue measure zero).
    [Show full text]
  • Interior Algebras: Some Universal Algebraic Aspects
    J. Korean Math. Soc. 30(1993), No. 1, pp. 1-24 INTERIOR ALGEBRAS: SOME UNIVERSAL ALGEBRAIC ASPECTS COLIN NATURMAN AND HENRY RoSEl Introduction The concept of a closure algebra, i.e. a Boolean algebra enriched with a closure operator, was introduced by McKinsey and Tarski in [4] as an algebraic generalization of a topological space. An interior algebra is a Boolean algebra enriched with an interior operator. Most modern topologists prefer to consider a topological space to be a set together with a family of open subsets and most algebraists working with lattice ordered algebras prefer to use filters instead of ideals. As a result of these trends it is more natural to work with interior alge­ bras than with closure algebras. However closure algebras and interior algebras are essentially the same thing. Before the introduction of closure algebras, it had already been no­ ticed that there is a connection between topology and modal logic (see McKinsey [3]). This connection is due to the fact that topologi­ cal spaces and modal logics both give rise to interior algebras. In [2] J6nsson and Tarski showed that the power algebra of a pre-ordered set is a closure·algebra. This is interesting in the light of the fact that pre-ordered sets are the models for the modal logic S4. Subsequent work on closure algebras focused mainly on applications to modal logic (see for example [1] and [6]) and their universal algebraic aspects have been neglected. Since most mathematicians are not familiar with closure algebras and since interior algebras are new we have devoted Section 1 of this paper to basic results concerning interior algebras.
    [Show full text]
  • Arxiv:2009.00218V1 [Math.LO]
    TEMPORAL INTERPRETATION OF INTUITIONISTIC QUANTIFIERS: MONADIC CASE GURAM BEZHANISHVILI AND LUCA CARAI Abstract. In a recent paper we showed that intuitionistic quantifiers admit the following tem- poral interpretation: “always in the future” (for ∀) and “sometime in the past” (for ∃). In this paper we study this interpretation for the monadic fragment MIPC of the intuitionistic predicate logic. It is well known that MIPC is translated fully and faithfully into the monadic fragment MS4 of the predicate S4 (G¨odel translation). We introduce a new tense extension of S4, denoted by TS4, and provide an alternative full and faithful translation of MIPC into TS4, which yields the temporal interpretation of monadic intuitionistic quantifiers mentioned above. We compare this new translation with the G¨odel translation by showing that both MS4 and TS4 can be translated fully and faithfully into a tense extension of MS4, which we denote by MS4.t. This is done by utilizing the algebraic and relational semantics for the new logics introduced. As a byproduct, we prove the finite model property (fmp) for MS4.t and show that the fmp for the other logics involved can be derived as a consequence of the fullness and faithfulness of the translations considered. 1. Introduction It is well known that, unlike classical quantifiers, the interpretation of intuitionistic quantifiers is non-symmetric in that ∀xA is true at a world w iff A is true at every object a in the domain Dv of every world v accessible from w, and ∃xA is true at w iff A is true at some object a in the domain Dw of w.
    [Show full text]
  • Chapter 1 AXIOMS, ALGEBRAS, and TOPOLOGY
    Chapter 1 AXIOMS, ALGEBRAS, AND TOPOLOGY Brandon Bennett ∗ School of Computer Studies University of Leeds Leeds LS2 9JT, United Kingdom [email protected] Ivo D¨untsch † Department of Computer Science Brock University St. Catharines, Ontario, Canada, L2S 3A1 [email protected] 1. Introduction This work explores the interconnections between a number of different perspectives on the formalisation of space. We begin with an informal discussion of the intuitions that motivate these formal representations. 1.1 Axioms vs Algebras Axiomatic theories provide a very general means for specifying the logical properties of formal concepts. From the axiomatic point of view, it is symbolic formulae and the logical relations between them — es- pecially the entailment relation — that form the primary subject of interest. The vocabulary of concepts of any theory can be interpreted in terms of a domain of entities, which exemplify properties, relations and functional mappings corresponding to the formal symbols of the theory. Moreover, by interpreting logical operations as functions of these seman- ∗This work was partially supported by the Engineering and Physical Sciences Research Coun- cil of the UK, under grant EP/D002834/1. †I. D¨untsch gratefully acknowledges support from the Natural Sciences and Engineering Re- search Council of Canada. 2 tic denotations, such an interpretation enables us to evaluate the truth of any logical formula built from these symbols. An interpretation is said to satisfy, or be a model of a theory, if all the axioms of the theory are true according to this evaluation. In general an axiomatic theory can have many different models ex- hibiting diverse structural properties.
    [Show full text]
  • Equivalence Relations and Operators on Ordered Algebraic Structures with Difference
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by InsubriaSPACE - Thesis PhD Repository 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 COMPUTER SCIENCE AND COMPUTATIONAL MATHEMATICS XXIX CYCLE EQUIVALENCE RELATIONS AND OPERATORS ON ORDERED ALGEBRAIC STRUCTURES WITH DIFFERENCE Candidate: FRANCESCO MARIGO Advisor: BRUNELLA GERLA Co-advisor: TOMMASO FLAMINIO Coordinators: CLAUDIO GENTILE MARCO DONATELLI 2016 Equivalence Relations and Operators on Ordered Algebraic Structures with Difference Francesco Marigo 2 Preface This work surveys the largest part of my research as Ph.D. student of the course “Informatica e Matematica del Calcolo” (Computer Science and Computational Mathematics) at the “Universita` degli Studi dell’Insubria” (Univesity of Insubria), done for most of the time at the “Dipartimento di Scienze Teoriche e Applicate” (Department of Theoretical and Applied Sciences) in Varese (Italy), with a visit of one month at the Department of Knowledge-Based Mathematical Systems of the Johannes Kepler University in Linz (Austria). The work concerns mainly algebraic models of fuzzy and many-valued proposi- tional logics, in particular Boolean Algebras, Heyting algebras, GBL-algebras and their dual structures, and partial algebras. The central idea is the representation of complex structures through simpler struc- tures and equivalence relations on them: in order to achieve this, a structure is often considered under two points of view, as total algebra and partial algebra. The equivalence relations which allow the representation are congruences of partial al- gebras.
    [Show full text]