RELATION ALGEBRAS. Roger D. MADDUX. Department of Mathematics Iowa State University Ames, Iowa USA ELSEVIER
|
|
- Albert Wells
- 5 years ago
- Views:
Transcription
1 RELATION ALGEBRAS Roger D. MADDUX Department of Mathematics Iowa State University Ames, Iowa USA ELSEVIER AMSTERDAM. BOSTON HEIDELBERG LONDON NEW YORK. OXFORD PARIS SAN DIEGO. SAN FRANCISCO. SINGAPORE. SYDNEY. TOKYO
2 Contents Preface List of Figures List of Tables vii xxiii xxv Chapter 1. Calculus of relations 1 1. De Morgan, Peirce, and Schroder 1 2. Binary relations 4 3. Complement and converse 5 4. Union and intersection 6 5. Relative multiplication and addition 7 6. More operations Four distinguished relations Axiomatization of the calculus of relations Definitions of relation algebras Undecidability and inexpressibility Incompleteness Representability Weakened associativity 31 Chapter 2. Set theory Classes, equality, membership, sets, and proper classes Language of set theory An axiomatization of set theory Axiom of Extensionality Virtual classes, names, and notational concerns Axiom of the Empty Set Axiom of Complementation Axiom of Intersection Calculus of classes Axiom of Unordered Pairs Axiom of Relative Product Axiom of Converse Axiom of the e-relation Axioms of the calculus of relations 58
3 xviii CONTENTS 15. Kinds of relations Coextensivity Functional and injective relations Functional and injective parts Projection functions Boolean and relative operations on sets Relation Existence Theorem Axiom of Singletons Class Union Axiom Class Existence Theorem Lifting relations to sets Replacement Axiom Set Union Axiom Powerset Axiom Partial orderings, meets, joins, and lattices Axiom of Infinity Axiom of Choice Axiom of Regularity Ordinals and cardinals Dedekind-MacNeille completion 102 Chapter 3. General algebra Algebraic structures Subalgebras Congruence relations and quotients Homomorphisms Filters and ideals Products of algebras ' -Operators S, H, I, P, Up Assembly Lemma Clones Free algebras ; Algebras of sets and relations ' Proper relation algebras and RRA Closure of RRA under subalgebras and products Relational ideals S and H commute on proper relation algebras Peircean ideals Closure of RRA under homomorphisms 159 Chapter 4. Logic with equality Syntax Semantics Axiomatization and formalisms Formalisms of Tarski-Givant Soundness 194
4 CONTENTS xix 6. Deduction theorem Implicational fragment Completeness of (HI), (HII), (HIII') Completeness of (LI)-(LIII) Quantifier axioms Equality axioms Axioms for a binary relational language Quotients of interpretations Consistent and complete theories Witnesses Completeness and compactness 230 Chapter 5. Boolean algebras Axioms R1-R Partial orderings, completeness, atoms, density Meets and joins of subsets Ideals, filters, and ultrafilters Functions between Boolean algebras Congruence relations, ideals, filters, and homomorphisms Complete additivity and multiplicativity Completeness and atoms Duals and conjugates Regular-open BA of a closure operator Regular-open BA of a topological closure operator Topological spaces and closure operators Complex algebra of a binary relation Complete BA of a partial ordering Completion of a BA Perfect extension of a BA Summary of constructions Extending Boolean operators, Composing extended Boolean operators \ Extending operators within a BA l Preservation theorems for complete extensions 285 Chapter 6. Relation algebras Boolean relation algebras Group relation algebras NA, WA, and SA Special kinds of elements Axioms R 7, R Axiom R Axioms R7, Axioms Rs, Axioms Re, Axioms R6 Rs, Rg R 7, Rs, R7, Rg, R.7, R-8 Rg, R
5 CONTENTS 11. Axioms R 5, Re, R7, R Axioms R 5, R 6, R7, Rs, Rg Axiom Rio with others Theorem K and the cycle law Special elements in NA Characterizations of NA and RA Duality for NA Completions Perfect extensions Matrices of elements Bases Elementary arithmetic in WA Properties of bases n-dimensional relation algebras Cycles of atoms Complex algebras of ternary relations The very nonassociative algebra in NA~WA McKinsey's algebra in WA ~ SA An algebra in SA~ RA Lyndon's nonrepresentable algebras in RA ~ RRA Jonsson's algebras from projective geometries Lyndon's algebras from projective geometries McKenzie's nonrepresentable algebra Allen's interval algebra Cycle structures of complex algebras Representation by complex algebras Elementary arithmetic in SA Associativity in groupoids Independence of seven weak associative laws Consequences of 4-associativity Relativization Ideals \ Ideal elements, relativization, and homomorphisms Simplicity Direct products Necessary subalgebras of SAs Elementary arithmetic in RA Functional elements Transitive and equivalence elements Forbidden matrices Equational basis for RA n Equational basis for RRA Representation theorems Cycles in structures Classification of simple finite algebras 420
6 CONTENTS xxi 56. Finite integral relation algebras with 0, 1, 2, or 3 atoms Finite integral relation algebras with 4 or 5 atoms Cycles of the algebras 1, Multiplication tables for algebras I Diversity cycles for the algebras Multiplication tables for the algebras Diversity cycles of the algebras lg Multiplication tables for algebras ls Failures of (J), (L), (M) among li-l Independence of (J), (L), and (M) dimensional relational basis data for 198 algebras Algebras of every dimension Flexible atoms Finite algebras with many automorphisms Splitting atoms RRA is not finitely based The number of finite integral relation algebras Many nonrepresentable relation algebras Algebras with few subalgebras Non-embeddable relation algebras Complex algebras of cycle structures Flexible systems of atoms Trails of matrices Singletons and twins in a simple SA Algebras from modular lattices Factor algebras A characterization of representability Complete representability '~ RRAs with no complete representations Point-density and pair-density Simple pair-dense algebras Complete representability results \ 521 Chapter 7. Algebraic logic Equipollence of C and C Inequipollence of x and Finite-variable formalisms Algebras of formulas Free RRAs of formulas SAs and RAs of formulas Algebraic semantics Algebraic satisfaction and substitution Algebraic soundness Free SAs and RAs of formulas Formalizing set theory in x 578
7 xxii CONTENTS Chapter finite integral relation algebras Cycles of algebras Ii3i6-1316i3i Cycles of algebras I3013-3OI33013, Failures of (J), (L), (M) among Ii3i6-1316i3i6 and I3013-3OI dimensional basis data for Ii3i6-1316i3i6 and I3013-3OI Bibliography 713 Index 723
Handbook of Logic and Proof Techniques for Computer Science
Steven G. Krantz Handbook of Logic and Proof Techniques for Computer Science With 16 Figures BIRKHAUSER SPRINGER BOSTON * NEW YORK Preface xvii 1 Notation and First-Order Logic 1 1.1 The Use of Connectives
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 informationAdvanced Topics in Relation Algebras
Advanced Topics in Relation Algebras Steven Givant Advanced Topics in Relation Algebras Relation Algebras, Volume 2 123 Steven Givant Department of Mathematics Mills College Oakland, CA, USA ISBN 978-3-319-65944-2
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 informationFINITE, INTEGRAL, AND FINITE-DIMENSIONAL RELATION ALGEBRAS: A BRIEF HISTORY.
FINITE, INTEGRAL, AND FINITE-DIMENSIONAL RELATION ALGEBRAS: A BRIEF HISTORY. ROGER D. MADDUX Abstract. Relation were invented by Tarski and his collaborators in the middle of the twentieth century. The
More informationContents Propositional Logic: Proofs from Axioms and Inference Rules
Contents 1 Propositional Logic: Proofs from Axioms and Inference Rules... 1 1.1 Introduction... 1 1.1.1 An Example Demonstrating the Use of Logic in Real Life... 2 1.2 The Pure Propositional Calculus...
More informationRelation algebras. Robin Hirsch and Ian Hodkinson. Thanks to the organisers for inviting us! And Happy New Year!
Relation algebras Robin Hirsch and Ian Hodkinson Thanks to the organisers for inviting us! And Happy New Year! Workshop outline 1. Introduction to relation algebras 2. Games 3. Monk algebras: completions,
More information03 Review of First-Order Logic
CAS 734 Winter 2014 03 Review of First-Order Logic William M. Farmer Department of Computing and Software McMaster University 18 January 2014 What is First-Order Logic? First-order logic is the study of
More informationRELEVANCE LOGIC AND THE CALCULUS OF RELATIONS
RELEVANCE LOGIC AND THE CALCULUS OF RELATIONS ROGER D. MADDUX Abstract. Sound and complete semantics for classical propositional logic can be obtained by interpreting sentences as sets. Replacing sets
More informationClass A is empty if no class belongs to A, so A is empty x (x / A) x (x A). Theorem 3. If two classes are empty, then they are equal.
Everything is a class. The relation = is the equality relation. The relation is the membership relation. A set is a class that is a member of some class. A class that is not a set is called a proper class.
More information2.2 Lowenheim-Skolem-Tarski theorems
Logic SEP: Day 1 July 15, 2013 1 Some references Syllabus: http://www.math.wisc.edu/graduate/guide-qe Previous years qualifying exams: http://www.math.wisc.edu/ miller/old/qual/index.html Miller s Moore
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 informationStanford Encyclopedia of Philosophy
Stanford Encyclopedia of Philosophy The Mathematics of Boolean Algebra First published Fri Jul 5, 2002; substantive revision Mon Jul 14, 2014 Boolean algebra is the algebra of two-valued logic with only
More informationON TARSKI S AXIOMATIC FOUNDATIONS OF THE CALCULUS OF RELATIONS arxiv: v1 [math.lo] 15 Apr 2016
ON TARSKI S AXIOMATIC FOUNDATIONS OF THE CALCULUS OF RELATIONS arxiv:1604.04655v1 [math.lo] 15 Apr 2016 HAJNAL ANDRÉKA, STEVEN GIVANT, PETER JIPSEN, AND ISTVÁN NÉMETI Abstract. It is shown that Tarski
More informationEquational Logic. Chapter Syntax Terms and Term Algebras
Chapter 2 Equational Logic 2.1 Syntax 2.1.1 Terms and Term Algebras The natural logic of algebra is equational logic, whose propositions are universally quantified identities between terms built up from
More informationBasic Algebraic Logic
ELTE 2013. September Today Past 1 Universal Algebra 1 Algebra 2 Transforming Algebras... Past 1 Homomorphism 2 Subalgebras 3 Direct products 3 Varieties 1 Algebraic Model Theory 1 Term Algebras 2 Meanings
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 informationReview CHAPTER. 2.1 Definitions in Chapter Sample Exam Questions. 2.1 Set; Element; Member; Universal Set Partition. 2.
CHAPTER 2 Review 2.1 Definitions in Chapter 2 2.1 Set; Element; Member; Universal Set 2.2 Subset 2.3 Proper Subset 2.4 The Empty Set, 2.5 Set Equality 2.6 Cardinality; Infinite Set 2.7 Complement 2.8 Intersection
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 informationCOMPUTER AIDED INVESTIGATIONS OF RELATION ALGEBRAS. Peter Jipsen
COMPUTER AIDED INVESTIGATIONS OF RELATION ALGEBRAS By Peter Jipsen Dissertation Submitted to the Faculty of the Graduate School of Vanderbilt University in partial fulfillment of the requirements for the
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 information1. Propositional Calculus
1. Propositional Calculus Some notes for Math 601, Fall 2010 based on Elliott Mendelson, Introduction to Mathematical Logic, Fifth edition, 2010, Chapman & Hall. 2. Syntax ( grammar ). 1.1, p. 1. Given:
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 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 informationPart II Logic and Set Theory
Part II Logic and Set Theory Theorems Based on lectures by I. B. Leader Notes taken by Dexter Chua Lent 2015 These notes are not endorsed by the lecturers, and I have modified them (often significantly)
More informationPart II. Logic and Set Theory. Year
Part II Year 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2018 60 Paper 4, Section II 16G State and prove the ǫ-recursion Theorem. [You may assume the Principle of ǫ- Induction.]
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 informationLATTICE THEORY.
LATTICE THEORY http://dx.doi.org/10.1090/pspum/002 PROCEEDINGS OF THE SECOND SYMPOSIUM IN PURE MATHEMATICS OF THE AMERICAN MATHEMATICAL SOCIETY Held at the U.S. Naval Postgraduate School Monterey, California
More information3 Boolean Algebra 3.1 BOOLEAN ALGEBRA
3 Boolean Algebra 3.1 BOOLEAN ALGEBRA In 1854, George Boole introduced the following formalism which eventually became Boolean Algebra. Definition. An algebraic system consisting of a set B of elements
More informationLogic via Algebra. Sam Chong Tay. A Senior Exercise in Mathematics Kenyon College November 29, 2012
Logic via Algebra Sam Chong Tay A Senior Exercise in Mathematics Kenyon College November 29, 2012 Abstract The purpose of this paper is to gain insight to mathematical logic through an algebraic perspective.
More informationAtom structures and Sahlqvist equations
Atom structures and Sahlqvist equations Yde Venema Department of Mathematics and Computer Science Vrije Universiteit De Boelelaan 1081 1081 HV Amsterdam July 28, 1997 Abstract This paper addresses the
More informationALGEBRA AND ALGEBRAIC COMPUTING ELEMENTS OF. John D. Lipson. Addison-Wesley Publishing Company, Inc.
ELEMENTS OF ALGEBRA AND ALGEBRAIC COMPUTING John D. Lipson University of Toronto PRO Addison-Wesley Publishing Company, Inc. Redwood City, California Menlo Park, California Reading, Massachusetts Amsterdam
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 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 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 informationThe role of the overlap relation in constructive mathematics
The role of the overlap relation in constructive mathematics Francesco Ciraulo Department of Mathematics and Computer Science University of PALERMO (Italy) ciraulo@math.unipa.it www.math.unipa.it/ ciraulo
More informationLogics for Compact Hausdorff Spaces via de Vries Duality
Logics for Compact Hausdorff Spaces via de Vries Duality Thomas Santoli ILLC, Universiteit van Amsterdam June 16, 2016 Outline Main goal: developing a propositional calculus for compact Hausdorff spaces
More informationHarmonious Logic: Craig s Interpolation Theorem and its Descendants. Solomon Feferman Stanford University
Harmonious Logic: Craig s Interpolation Theorem and its Descendants Solomon Feferman Stanford University http://math.stanford.edu/~feferman Interpolations Conference in Honor of William Craig 13 May 2007
More informationInformal Statement Calculus
FOUNDATIONS OF MATHEMATICS Branches of Logic 1. Theory of Computations (i.e. Recursion Theory). 2. Proof Theory. 3. Model Theory. 4. Set Theory. Informal Statement Calculus STATEMENTS AND CONNECTIVES Example
More informationBoolean Semilattices
Boolean Semilattices Clifford Bergman Iowa State University June 2015 Motivating Construction Let G = G, be a groupoid (i.e., 1 binary operation) Form the complex algebra G + = Sb(G),,,,,, G X Y = { x
More informationDuality in Logic. Duality in Logic. Lecture 2. Mai Gehrke. Université Paris 7 and CNRS. {ε} A ((ab) (ba) ) (ab) + (ba) +
Lecture 2 Mai Gehrke Université Paris 7 and CNRS A {ε} A ((ab) (ba) ) (ab) + (ba) + Further examples - revisited 1. Completeness of modal logic with respect to Kripke semantics was obtained via duality
More informationREPRESENTATION THEOREMS FOR IMPLICATION STRUCTURES
Wojciech Buszkowski REPRESENTATION THEOREMS FOR IMPLICATION STRUCTURES Professor Rasiowa [HR49] considers implication algebras (A,, V ) such that is a binary operation on the universe A and V A. In particular,
More informationChapter 1 : The language of mathematics.
MAT 200, Logic, Language and Proof, Fall 2015 Summary Chapter 1 : The language of mathematics. Definition. A proposition is a sentence which is either true or false. Truth table for the connective or :
More informationON THE LOGIC OF CLOSURE ALGEBRA
Bulletin of the Section of Logic Volume 40:3/4 (2011), pp. 147 163 Ahmet Hamal ON THE LOGIC OF CLOSURE ALGEBRA Abstract An open problem in modal logic is to know if the fusion S4 S4 is the complete modal
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 informationAxiomatizability of Algebras of Binary Relations
Axiomatizability of Algebras of Binary Relations Szabolcs Mikulás Department of Computer Science and Information Systems Birkbeck, University of London szabolcs@dcs.bbk.ac.uk 22/09/2010 Sz. Mikulás ()
More informationCompleteness ofa relational calculus for program schemes
Theoretical Computer Science 54 () 543 556 www.elsevier.com/locate/tcs Completeness ofa relational calculus for program schemes Marcelo F. Frias, Roger D. Maddux Department of Mathematics, 4 Carver Hall,
More informationThe Reflection Theorem
The Reflection Theorem Formalizing Meta-Theoretic Reasoning Lawrence C. Paulson Computer Laboratory Lecture Overview Motivation for the Reflection Theorem Proving the Theorem in Isabelle Applying the Reflection
More informationFoundations of Mathematics
Foundations of Mathematics L. Brian Lawrence Department of Mathematics George Mason University Fairfax, VA 22030 4444 U.S.A. e mail: blawrenc@mail.gmu.edu January 1, 2007 Preface This set of notes is an
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 informationMonadic GMV -algebras
Department of Algebra and Geometry Faculty of Sciences Palacký University of Olomouc Czech Republic TANCL 07, Oxford 2007 monadic structures = algebras with quantifiers = algebraic models for one-variable
More informationAMS regional meeting Bloomington, IN April 1, 2017
Joint work with: W. Boney, S. Friedman, C. Laskowski, M. Koerwien, S. Shelah, I. Souldatos University of Illinois at Chicago AMS regional meeting Bloomington, IN April 1, 2017 Cantor s Middle Attic Uncountable
More informationDISJOINT-UNION PARTIAL ALGEBRAS
Logical Methods in Computer Science Vol. 13(2:10)2017, pp. 1 31 https://lmcs.episciences.org/ Submitted Dec. 07, 2016 Published Jun. 22, 2017 DISJOINT-UNION PARTIAL ALGEBRAS ROBIN HIRSCH AND BRETT MCLEAN
More informationTutorial on the Constraint Satisfaction Problem
Tutorial on the Constraint Satisfaction Problem Miklós Maróti Vanderbilt University and University of Szeged Nový Smokovec, 2012. September 2 7. Miklós Maróti (Vanderbilt and Szeged) The Constraint Satisfaction
More informationMAGIC Set theory. lecture 1
MAGIC Set theory lecture 1 David Asperó University of East Anglia 15 October 2014 Welcome Welcome to this set theory course. This will be a 10 hour introduction to set theory. The only prerequisite is
More informationStone and Heyting duality for classical and intuitionistic propositional logic
Stone and Heyting duality for classical and intuitionistic propositional logic Author: Laura van Schijndel Supervisor: Prof. dr. N. P. Landsman Bachelor thesis FNWI Radboud University August 2017 Abstract
More informationDigital Control Engineering Analysis and Design
Digital Control Engineering Analysis and Design M. Sami Fadali Antonio Visioli AMSTERDAM BOSTON HEIDELBERG LONDON NEW YORK OXFORD PARIS SAN DIEGO SAN FRANCISCO SINGAPORE SYDNEY TOKYO Academic Press is
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 informationLogics above S4 and the Lebesgue measure algebra
Logics above S4 and the Lebesgue measure algebra Tamar Lando Abstract We study the measure semantics for propositional modal logics, in which formulas are interpreted in the Lebesgue measure algebra M,
More informationhal , version 1-21 Oct 2009
ON SKOLEMISING ZERMELO S SET THEORY ALEXANDRE MIQUEL Abstract. We give a Skolemised presentation of Zermelo s set theory (with notations for comprehension, powerset, etc.) and show that this presentation
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 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 informationOverview of Topics. Finite Model Theory. Finite Model Theory. Connections to Database Theory. Qing Wang
Overview of Topics Finite Model Theory Part 1: Introduction 1 What is finite model theory? 2 Connections to some areas in CS Qing Wang qing.wang@anu.edu.au Database theory Complexity theory 3 Basic definitions
More informationAli Enayat & Albert Visser. Department of Philosophy, Faculty of Humanities, Utrecht University. Kotlarski-Ratajczyk Conference
SEQUENTIAL THEORIES Ali Enayat & Albert Visser Department of Philosophy, Faculty of Humanities, Utrecht University Kotlarski-Ratajczyk Conference July 24, 2012, Będlewo 1 Overview 2 Overview 2 Overview
More information1. Propositional Calculus
1. Propositional Calculus Some notes for Math 601, Fall 2010 based on Elliott Mendelson, Introduction to Mathematical Logic, Fifth edition, 2010, Chapman & Hall. 2. Syntax ( grammar ). 1.1, p. 1. Given:
More informationCanonicity and representable relation algebras
Canonicity and representable relation algebras Ian Hodkinson Joint work with: Rob Goldblatt Robin Hirsch Yde Venema What am I going to do? In the 1960s, Monk proved that the variety RRA of representable
More informationImperial College London Department of Computing. Exploring Canonical Axiomatisations of Representable Cylindric Algebras
Imperial College London Department of Computing Final year project Exploring Canonical Axiomatisations of Representable Cylindric Algebras Author: Jannis Bulian Supervisor: Prof. Ian Hodkinson Second Marker:
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 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 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 informationTHE EQUATIONAL THEORIES OF REPRESENTABLE RESIDUATED SEMIGROUPS
TH QUATIONAL THORIS OF RPRSNTABL RSIDUATD SMIGROUPS SZABOLCS MIKULÁS Abstract. We show that the equational theory of representable lower semilattice-ordered residuated semigroups is finitely based. We
More informationTUKEY QUOTIENTS, PRE-IDEALS, AND NEIGHBORHOOD FILTERS WITH CALIBRE (OMEGA 1, OMEGA) by Jeremiah Morgan BS, York College of Pennsylvania, 2010
TUKEY QUOTIENTS, PRE-IDEALS, AND NEIGHBORHOOD FILTERS WITH CALIBRE (OMEGA 1, OMEGA) by Jeremiah Morgan BS, York College of Pennsylvania, 2010 Submitted to the Graduate Faculty of the Kenneth P. Dietrich
More informationBasics of Relation Algebra. Jules Desharnais Département d informatique et de génie logiciel Université Laval, Québec, Canada
Basics of Relation Algebra Jules Desharnais Département d informatique et de génie logiciel Université Laval, Québec, Canada Plan 1. Relations on a set 2. Relation algebra 3. Heterogeneous relation algebra
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 informationFundamentals of Applied Probability and Random Processes
Fundamentals of Applied Probability and Random Processes,nd 2 na Edition Oliver C. Ibe University of Massachusetts, LoweLL, Massachusetts ip^ W >!^ AMSTERDAM BOSTON HEIDELBERG LONDON NEW YORK OXFORD PARIS
More informationWith Question/Answer Animations. Chapter 2
With Question/Answer Animations Chapter 2 Chapter Summary Sets The Language of Sets Set Operations Set Identities Functions Types of Functions Operations on Functions Sequences and Summations Types of
More informationSeminar I Boolean and Modal Algebras
Seminar I Boolean and Modal Algebras Dana S. Scott University Professor Emeritus Carnegie Mellon University Visiting Scholar University of California, Berkeley Visiting Fellow Magdalen College, Oxford
More informationLogics of n-ary Contact
Sofia University St. Kliment Ohridski Faculty of Mathematics and Informatics Department of Mathematical Logic and Its Applications Master Thesis Logics of n-ary Contact Ivan Zheliazkov Nikolov M.Sc. Logics
More information260 Index. Cut (cont.) rank, 193, 202 segment, 201 Cut-off subtraction, 211
References J. Barwise (ed.). Handbook of Mathematical Logic. North-Holland, Amsterdam, 1977 G. Boolos. The Logic of Provability. Cambridge University Press, Cambridge, 1993 E. Börger. Computability, Complexity,
More informationUniversal Algebra for Logics
Universal Algebra for Logics Joanna GRYGIEL University of Czestochowa Poland j.grygiel@ajd.czest.pl 2005 These notes form Lecture Notes of a short course which I will give at 1st School on Universal Logic
More informationRELATION ALGEBRAS AS EXPANDED FL-ALGEBRAS
RELATION ALGEBRAS AS EXPANDED FL-ALGEBRAS NIKOLAOS GALATOS AND PETER JIPSEN Abstract. This paper studies generalizations of relation algebras to residuated lattices with a unary De Morgan operation. Several
More informationPartial model checking via abstract interpretation
Partial model checking via abstract interpretation N. De Francesco, G. Lettieri, L. Martini, G. Vaglini Università di Pisa, Dipartimento di Ingegneria dell Informazione, sez. Informatica, Via Diotisalvi
More informationCHARACTERIZATION THEOREM OF 4-VALUED DE MORGAN LOGIC. Michiro Kondo
Mem. Fac. Sci. Eng. Shimane Univ. Series B: Mathematical Science 31 (1998), pp. 73 80 CHARACTERIZATION THEOREM OF 4-VALUED DE MORGAN LOGIC Michiro Kondo (Received: February 23, 1998) Abstract. In this
More informationEXTENDED MEREOTOPOLOGY BASED ON SEQUENT ALGEBRAS: Mereotopological representation of Scott and Tarski consequence relations
EXTENDED MEREOTOPOLOGY BASED ON SEQUENT ALGEBRAS: Mereotopological representation of Scott and Tarski consequence relations Dimiter Vakarelov Department of mathematical logic, Faculty of mathematics and
More informationOn the size of Heyting Semi-Lattices and Equationally Linear Heyting Algebras
On the size of Heyting Semi-Lattices and Equationally Linear Heyting Algebras Peter Freyd pjf@upenn.edu July 17, 2017 The theory of Heyting Semi-Lattices, hsls for short, is obtained by adding to the theory
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 informationThe non-logical symbols determine a specific F OL language and consists of the following sets. Σ = {Σ n } n<ω
1 Preliminaries In this chapter we first give a summary of the basic notations, terminology and results which will be used in this thesis. The treatment here is reduced to a list of definitions. For the
More information586 Index. vertex, 369 disjoint, 236 pairwise, 272, 395 disjoint sets, 236 disjunction, 33, 36 distributive laws
Index absolute value, 135 141 additive identity, 254 additive inverse, 254 aleph, 465 algebra of sets, 245, 278 antisymmetric relation, 387 arcsine function, 349 arithmetic sequence, 208 arrow diagram,
More informationFinite Simple Abelian Algebras are Strictly Simple
Finite Simple Abelian Algebras are Strictly Simple Matthew A. Valeriote Abstract A finite universal algebra is called strictly simple if it is simple and has no nontrivial subalgebras. An algebra is said
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 informationPMATH 300s P U R E M A T H E M A T I C S. Notes
P U R E M A T H E M A T I C S Notes 1. In some areas, the Department of Pure Mathematics offers two distinct streams of courses, one for students in a Pure Mathematics major plan, and another for students
More informationarxiv: v2 [math.lo] 25 Jul 2017
Luca Carai and Silvio Ghilardi arxiv:1702.08352v2 [math.lo] 25 Jul 2017 Università degli Studi di Milano, Milano, Italy luca.carai@studenti.unimi.it silvio.ghilardi@unimi.it July 26, 2017 Abstract The
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 informationA Note on Superamorphous Sets and Dual Dedekind-Infinity
arxiv:math/9504201v1 [math.lo] 18 Apr 1995 A Note on Superamorphous Sets and Dual Dedekind-Infinity 1 Introduction Martin Goldstern April 3, 1995 In the absence of the axiom of choice there are several
More informationPart III Logic. Theorems. Based on lectures by T. E. Forster Notes taken by Dexter Chua. Lent 2017
Part III Logic Theorems Based on lectures by T. E. Forster Notes taken by Dexter Chua Lent 2017 These notes are not endorsed by the lecturers, and I have modified them (often significantly) after lectures.
More informationBASIC MATHEMATICAL TECHNIQUES
CHAPTER 1 ASIC MATHEMATICAL TECHNIQUES 1.1 Introduction To understand automata theory, one must have a strong foundation about discrete mathematics. Discrete mathematics is a branch of mathematics dealing
More informationLogic, Mathematics, and Computer Science
Logic, Mathematics, and Computer Science Yves Nievergelt Logic, Mathematics, and Computer Science Modern Foundations with Practical Applications Second Edition 123 Yves Nievergelt Department of Mathematics
More informationThe Countable Henkin Principle
The Countable Henkin Principle Robert Goldblatt Abstract. This is a revised and extended version of an article which encapsulates a key aspect of the Henkin method in a general result about the existence
More information185.A09 Advanced Mathematical Logic
185.A09 Advanced Mathematical Logic www.volny.cz/behounek/logic/teaching/mathlog13 Libor Běhounek, behounek@cs.cas.cz Lecture #1, October 15, 2013 Organizational matters Study materials will be posted
More information