AN ALGORITHM FOR FINDING FINITE AXIOMATIZATIONS OF FINITE INTERMEDIATE LOGICS BY MEANS OF JANKOV FORMULAS. Abstract
|
|
- Amice Golden
- 5 years ago
- Views:
Transcription
1 Bulletin of the Section of Logic Volume 31/1 (2002), pp. 1 6 Eugeniusz Tomaszewski AN ALGORITHM FOR FINDING FINITE AXIOMATIZATIONS OF FINITE INTERMEDIATE LOGICS BY MEANS OF JANKOV FORMULAS Abstract In the paper a new algorithm for finding finite axiomatizations of varieties of Heyting algebras generated by a single finite algebra is given. The novelty of this algorithm is that it produces axiomatizations which utilize only Jankov characteristic formulas. 1. Introduction It was proved constructively by D. H. J. de Jongh that every finite intermediate logic (i.e. logic determined by a variety of Heyting algebras generated from a finite Heyting algebra) is finitely axiomatizable. Another constructive proof of this fact was given by A. S. Troelstra, and an elegant algorithm for finding such axiomatizations was constructed by A. Wroński in [4]. In this paper I would like to present yet another algorithm, which essentially utilizes the approach adopted by the last author. The new algorithm shows, however, that we can confine ourselves to Jankov formulas in order to obtain the desired axiomatization. This means that the class of Jankov formulas is rich enough to axiomatize every finite intermediate logic, which is not true in general, i.e. when we consider all intermediate logics. The result discussed in the present paper was presented at the XLVII History of Logic Conference, Kraków, October 23-24, 2001.
2 2 Eugeniusz Tomaszewski To start with, I would like to introduce some notions and remind some facts I will make use of later on. Our general aim is to determine a variety of Heyting algebras by means of a set of formulas. Let V, W be varieties of Heyting algebras, and V SI, W SI subdirectly irreducible algebras of these varieties respectively. H will denote the variety of all Heyting algebras. As every variety is determined by its subdirectly irreducible members, we will confine our considerations to subdirectly irreducible algebras (sub-irr algebras for short). Thus, to determine any variety V of Heyting algebras, it means to find a suitable set Σ V of formulas in intuitionistic language, such as V SI = Σ V and for any sub-irr algebra A V SI there exists a formula σ Σ V so as A = σ. It happens that Jankov formulas posses characteristics which can prove useful when constructing a set Σ V. As Jankov formulas are strictly connected with finite sub-irr Heyting algebras, we should have in mind the following useful characterization (due to A. Day): a Heyting algebra A is sub-irr iff there is a greatest element in A {1}, where 1 is the greatest element in A. Such element is usually denoted by. Definition 1. Let A be a finite subdirectly irreducible Heyting algebra. Choose a 1-1 map from its universe onto a subset of variables (thus a x is a variable assigned by this map to an element x). Characteristic (Jankov) formula over A χ(a) is defined as follows: (ax a y ) a x y x, y A ) (ax a y ) a x y x, y A ) (ax a y ) a x y x, y A ) ax a x x A ) a Fact 1. By defining a suitable valuation we get easily the following fact: For any finite sub-irr algebra A, A = χ(a). The next theorem, proved by V. Jankov in [2] characterises the entire class of algebras which refute the formula χ(a) for a given algebra A.
3 An Algorithm for Finding Finite Axiomatizations... 3 Theorem 1. (V. Jankov) For any algebra B and any finite sub-irr algebra A the following holds B = χ(a) iff A SH(B). From Jankov s theorem it follows that if a finite sub-irr algebra A does not belong to a variety V we want to axiomatise, then we can add χ(a) to the set Σ V. To see this, let us suppose that there is an algebra B V such that B = χ(a). This would mean, however, that A SH(B) and thus A is in V as well. Furthermore, let W be the variety axiomatized by characteristic formulas on all finite sub-irr algebras not in V. It is obvious that V W and for any finite sub-irr algebra M, M V iff M W (i.e. V F SI = W F SI ). Thus, it is a straightforward task to determine the variety V with respect to its finite members. The real challenge is to deal with infinite sub-irr algebras or to get a finite axiomatization. We will need one more specific fact concerning Jankov formulas. If V (α) denotes the variety determined by a formula α (i.e. V (α) = {A H : A = α}) then we get the following. Fact 2. Let A be a finite sub-irr algebra. Then W = V (χ(a)) is the largest variety not containing the algebra A. Proof. If A V then V = χ(a) (by Jankov s theorem), so for every such variety, V W. A W (since A = χ(a)), so W is the largest variety not containing A. In our algorithm, an essential role will be played by linear Heyting algebras. Following A. Day [1], let (H : C n ) (where C n is an n-element linear Heyting algebra for n 2) denote the class {A H : C n S(A)}. As the finite chains are projective Heyting algebras, (H : C n ) is a variety for every n 2. In fact, it is the greatest variety not containing C n. In his manuscript, A. Day has shown that all these varieties are locally finite. In the proof, the following characterisation of sub-irr algebras in (H : C n ) was used. (A denots the algebra obtained from an algebra A by adding a new greatest element and suitably expanding Heyting operations.)
4 4 Eugeniusz Tomaszewski Lemma 1 For n 2, (H : C n+1 ) SI = {A : A (H : C n )}. Proof. It is easy to prove that C n S(A) iff C n+1 S(A ). As every sub-irr algebra B has the form A for a suitable algebra A, we get: A (H : C n+1 ) SI iff C n+1 S(A ) iff C n S(A) iff A (H : C n ), which concludes the proof. Theorem 2. For every n 2, the variety (H : C n ) is locally finite. Proof. We will show that in every variety (H : C n ), the free generated algebra F (k) on k generators is finite for each k, which is an equivalent condition for (H : C n ) being locally finite. (n = 2) (H : C 2 ) is locally finite as it is the variety of all trivial algebras. (n > 2) Let F (k) be the k-generated free algebra in (H : C n+1 ). F (k) P S ({A i } i I ), where A i are sub-irr, k-generated algebras belonging to (H : C n+1 ). Thus, every A i = B i for some B i (H : C n ) by Lemma 1. Now, as B i is k-generated, by the Induction Hypothesis we get that it is a finite algebra and there are only finitely many such algebras in (H : C n ). Therefore, F (k) V ({A i } i I ) where I is finite and every A i is a finite algebra. Hence, F (k) is finite as well. 2. Algorithm Now, we are ready to construct an algorithm which for every finite intermediate logic produces suitable finite axiomatization utilizing only Jankov formulas. As this algorithm is a generalization of the algorithm used in [4], I introduce the idea of the latter first. As every finite intermediate logic is determined by a variety of Heyting algebras generated from a single finite algebra, say A, this variety contains only finitely many sub-irr algebras and all of them are finite. This is an immediate consequence of the fact that the variety of Heyting algebras is congruence-distributive and the well known Jonsson s theorem concerning such varieties. Thus, there is an integer number n such that every sub-irr algebra in V (A) has at most n elements. Now, there is a single axiom γ n = (a i a j i, j = 1,..., n + 1, i j) which is true exactly in these sub-irr algebras that have less than n + 1 elements, as the following lemma due to C. G. McKay [3] states.
5 An Algorithm for Finding Finite Axiomatizations... 5 Lemma 2. Let A be a sub-irr Heyting algebra. Then A = γ n iff A n. In order to find a finite axiomatization of the variety V (A), it suffices to adopt the following procedure. Firstly, list all sub-irr algebras not in V (A) which have n elements at most. We get a finite set of finite sub-irr algebras, say {A 1,..., A k } and a finite set of Jankov formulas defined on them: {χ(a 1 ),..., χ(a k )}. Secondly, add to these Jankov formulas the formula γ n. Then {χ(a 1 ),..., χ(a k ), γ n } constitutes a suitable axiomatization of V (A). As a matter of fact, we do not need to take all algebras {A 1,..., A k }. If A i V (A j ) then we can use the axiom χ(a i ) instead of {χ(a i ), χ(a j )}. The interesting issue, however, is the question how to replace the formula γ n with a finite set of Jankov formulas. To do this, we will need the following lemma. Lemma 3. Let W be a locally finite variety of Heyting algebras. Then each its subvariety V generated from a single finite algebra can be determined, relatively to W, by a finite set of characteristic formulas. Proof. If V is a subvariety of W generated by a single finite algebra, then there is some integer m such that all subdirectly irreducible algebras in V have at most m elements. We list all algebras A 1,..., A k, such that A i W V and A i m. Obviously, for every such algebra A j, A j = k i=1 χ(a i) and V = k i=1 χ(a i). Now, let B be a sub-irr algebra from W V and B m + 1. Every such algebra B has an m + 1-generated subalgebra which is finite (as W is locally finite) and subdirectly irreducible (as any finite subalgebra of a subdirectly irreducible algebra is again subdirectly irreducible). We know also that there are only finitely many m + 1-generated subdirectly irreducible algebras in W, because of the local finiteness of W. Now, let B 1,..., B l be all these algebras. Then, for every sub-irr B W V such that B m+1 there is i {1,..., l} such that B i S(B). Thus B = χ(b i ). Obviously, V = l i=1 χ(b i). Thus, the variety V is determined relatively to W by means of a finite set of characteristic formulas on algebras {A 1,..., A k, B 1,..., B l }. Combining the above lemma with the results of A. Day, it is easy to prove that every variety generated by a finite Heyting algebra can actually be axiomatized by a finite set of Jankov formulas.
6 6 Eugeniusz Tomaszewski Theorem 3. Let V be a variety of Heyting algebras generated by a finite algebra. Then V is finitely axiomatizable by means of Jankov formulas. In fact, there is an algorithm, which for every such variety produces desired axiomatization. Proof. To prove the theorem we only need to find a locally finite variety W such as V W and W can be axiomatized by a finite set of Jankov formulas. Let m be the maximal number of elements in any sub-irr algebra in V. Then the linear algebra C m+1 does not belong to V, which means that V is a subvariety of the locally finite variety (H : C m+1 ). As (H : C m+1 ) is the greatest variety not containing C m+1, it is axiomatized by means of χ(c m+1 ) Jankov formula according to Fact 2. Given this axiomatization as well as local finiteness of (H : C m+1 ) we get that it is a decidable variety and the number of elements of any k-generated free algebra in it can be effectively determined. Thus V can be axiomatized by Jankov formulas on algebras {C m+1, A 1,..., A k, B 1,..., B l }, where A 1,..., A k, B 1,..., B l are to be found as in Lemma 3 which can be done effectively. References [1] A. Day, Varieties of Heyting algebras I, Manuscript. [2] V. A. Jankov, Conjunctively indecomposable formulas in propositional calculi, Izvestiya. Mathematics. Presidium Russ. Acad. Sci., Moscow, 3 (1969), [3] C. G. McKay, On finite logics, Indagationes Mathematicae, 29 (1967), [4] A. Wroński, An algorithm for finding finite axiomatizations of finite intermediate logics, Zeszyty Naukowe Uniwersytetu Jagiellońskiego, Prace z logiki, 7 (1972), Jagiellonian University Department of Logic Grodzka 52, Kraków, Poland tomaszew@if.uj.edu.pl
On 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 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 informationKazimierz SWIRYDOWICZ UPPER PART OF THE LATTICE OF EXTENSIONS OF THE POSITIVE RELEVANT LOGIC R +
REPORTS ON MATHEMATICAL LOGIC 40 (2006), 3 13 Kazimierz SWIRYDOWICZ UPPER PART OF THE LATTICE OF EXTENSIONS OF THE POSITIVE RELEVANT LOGIC R + A b s t r a c t. In this paper it is proved that the interval
More information1 Completeness Theorem for Classical Predicate
1 Completeness Theorem for Classical Predicate Logic The relationship between the first order models defined in terms of structures M = [M, I] and valuations s : V AR M and propositional models defined
More informationON CARDINALITY OF MATRICES STRONGLY ADEQUATE FOR THE INTUITIONISTIC PROPOSITIONAL LOGIC
Bulletin of the Section of Logic Volume 3/1 (1974), pp. 34 38 reedition 2012 [original edition, pp. 34 40] Andrzej Wroński ON CARDINALITY OF MATRICES STRONGLY ADEQUATE FOR THE INTUITIONISTIC PROPOSITIONAL
More informationChristopher J. TAYLOR
REPORTS ON MATHEMATICAL LOGIC 51 (2016), 3 14 doi:10.4467/20842589rm.16.001.5278 Christopher J. TAYLOR DISCRIMINATOR VARIETIES OF DOUBLE-HEYTING ALGEBRAS A b s t r a c t. We prove that a variety of double-heyting
More informationDe Jongh s characterization of intuitionistic propositional calculus
De Jongh s characterization of intuitionistic propositional calculus Nick Bezhanishvili Abstract In his PhD thesis [10] Dick de Jongh proved a syntactic characterization of intuitionistic propositional
More information1 Completeness Theorem for First Order Logic
1 Completeness Theorem for First Order Logic There are many proofs of the Completeness Theorem for First Order Logic. We follow here a version of Henkin s proof, as presented in the Handbook of Mathematical
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 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 informationPOL502: Foundations. Kosuke Imai Department of Politics, Princeton University. October 10, 2005
POL502: Foundations Kosuke Imai Department of Politics, Princeton University October 10, 2005 Our first task is to develop the foundations that are necessary for the materials covered in this course. 1
More informationKRIPKE S THEORY OF TRUTH 1. INTRODUCTION
KRIPKE S THEORY OF TRUTH RICHARD G HECK, JR 1. INTRODUCTION The purpose of this note is to give a simple, easily accessible proof of the existence of the minimal fixed point, and of various maximal fixed
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 informationALL NORMAL EXTENSIONS OF S5-SQUARED ARE FINITELY AXIOMATIZABLE
ALL NORMAL EXTENSIONS OF S5-SQUARED ARE FINITELY AXIOMATIZABLE Nick Bezhanishvili and Ian Hodkinson Abstract We prove that every normal extension of the bi-modal system S5 2 is finitely axiomatizable and
More informationSUBLATTICES OF LATTICES OF ORDER-CONVEX SETS, III. THE CASE OF TOTALLY ORDERED SETS
SUBLATTICES OF LATTICES OF ORDER-CONVEX SETS, III. THE CASE OF TOTALLY ORDERED SETS MARINA SEMENOVA AND FRIEDRICH WEHRUNG Abstract. For a partially ordered set P, let Co(P) denote the lattice of all order-convex
More informationInterpolation and Beth Definability over the Minimal Logic
Interpolation and Beth Definability over the Minimal Logic Larisa Maksimova 1 Sobolev Institute of Mathematics Siberian Branch of Russian Academy of Sciences Novosibirsk 630090, Russia Abstract Extensions
More informationOn Refutation Rules. Tomasz Skura. 1. Introduction. Logica Universalis
Log. Univers. 5 (2011), 249 254 c 2011 The Author(s). This article is published with open access at Springerlink.com 1661-8297/11/020249-6, published online October 2, 2011 DOI 10.1007/s11787-011-0035-4
More informationAndrzej WROŃSKI ON PRUCNAL S MODEL DETERMINED LOGIC AND DEFINABLE PREDICATES
REPORTS ON MATHEMATICAL LOGIC 38 (2004), 87 91 Andrzej WROŃSKI ON PRUCNAL S MODEL DETERMINED LOGIC AND DEFINABLE PREDICATES A b s t r a c t. Prucnal s concept of a logic determined by a model is discussed.
More informationRefutability and Post Completeness
Refutability and Post Completeness TOMASZ SKURA Abstract The goal of this paper is to give a necessary and sufficient condition for a multiple-conclusion consequence relation to be Post complete by using
More information4.4 Noetherian Rings
4.4 Noetherian Rings Recall that a ring A is Noetherian if it satisfies the following three equivalent conditions: (1) Every nonempty set of ideals of A has a maximal element (the maximal condition); (2)
More informationAN EXTENSION OF THE PROBABILITY LOGIC LP P 2. Tatjana Stojanović 1, Ana Kaplarević-Mališić 1 and Zoran Ognjanović 2
45 Kragujevac J. Math. 33 (2010) 45 62. AN EXTENSION OF THE PROBABILITY LOGIC LP P 2 Tatjana Stojanović 1, Ana Kaplarević-Mališić 1 and Zoran Ognjanović 2 1 University of Kragujevac, Faculty of Science,
More informationThe logic of perfect MV-algebras
The logic of perfect MV-algebras L. P. Belluce Department of Mathematics, British Columbia University, Vancouver, B.C. Canada. belluce@math.ubc.ca A. Di Nola DMI University of Salerno, Salerno, Italy adinola@unisa.it
More informationLOGICS OF VARIETIES, LOGICS OF SEMILATTICES, AND CONJUNCTION
LOGICS OF VARIETIES, LOGICS OF SEMILATTICES, AND CONJUNCTION JOSEP MARIA FONT AND TOMMASO MORASCHINI Abstract. This paper starts with a general analysis of the problem of how to associate a logic with
More informationLOGIC OF CLASSICAL REFUTABILITY AND CLASS OF EXTENSIONS OF MINIMAL LOGIC
Logic and Logical Philosophy Volume 9 (2001), 91 107 S. P. Odintsov LOGIC OF CLASSICAL REFUTABILITY AND CLASS OF EXTENSIONS OF MINIMAL LOGIC Introduction This article continues the investigation of paraconsistent
More informationPropositional Logics and their Algebraic Equivalents
Propositional Logics and their Algebraic Equivalents Kyle Brooks April 18, 2012 Contents 1 Introduction 1 2 Formal Logic Systems 1 2.1 Consequence Relations......................... 2 3 Propositional Logic
More informationadmissible and derivable rules in intuitionistic logic
admissible and derivable rules in intuitionistic logic Paul Rozière Equipe de Logique, CNRS UA 753 Université Paris 7 2 place Jussieu, 75230 PARIS cedex 05 roziere@logique.jussieu.fr preliminary draft,
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 informationPřednáška 12. Důkazové kalkuly Kalkul Hilbertova typu. 11/29/2006 Hilbertův kalkul 1
Přednáška 12 Důkazové kalkuly Kalkul Hilbertova typu 11/29/2006 Hilbertův kalkul 1 Formal systems, Proof calculi A proof calculus (of a theory) is given by: A. a language B. a set of axioms C. a set of
More informationSUPER-LUKASIEWICZ IMPLICATIONAL LOGICS YUICHI KOMORI
Y. Komori Nagoya Math. J. Vol. 72 (1978), 127-133 SUPER-LUKASIEWICZ IMPLICATIONAL LOGICS YUICHI KOMORI 1. Introduction In the traditional study of Lukasiewicz propositional logic, the finite-valued or
More informationConstructive Logic. Thierry Coquand. August 2008
Thierry Coquand August 2008 This course To present constructive mathematics using logic Introduction to recent work in constructive algebra (H. Lombardi, P. Schuster, I. Yengui,... ) Connection with computer
More informationIn [3], Hallden in effect suggests that a modal (or other) system S 1}
296 Notre Dame Journal of Formal Logic Volume VII, Number 4, October 1966 A NOTE ON HALLDEN-INCOMPLETENESS E. J. LEMMON In [3], Hallden in effect suggests that a modal (or other) system S 1} is unreasonable
More informationPEANO AXIOMS FOR THE NATURAL NUMBERS AND PROOFS BY INDUCTION. The Peano axioms
PEANO AXIOMS FOR THE NATURAL NUMBERS AND PROOFS BY INDUCTION The Peano axioms The following are the axioms for the natural numbers N. You might think of N as the set of integers {0, 1, 2,...}, but it turns
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 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 informationIDEMPOTENT RESIDUATED STRUCTURES: SOME CATEGORY EQUIVALENCES AND THEIR APPLICATIONS
IDEMPOTENT RESIDUATED STRUCTURES: SOME CATEGORY EQUIVALENCES AND THEIR APPLICATIONS N. GALATOS AND J.G. RAFTERY Abstract. This paper concerns residuated lattice-ordered idempotent commutative monoids that
More information2. Prime and Maximal Ideals
18 Andreas Gathmann 2. Prime and Maximal Ideals There are two special kinds of ideals that are of particular importance, both algebraically and geometrically: the so-called prime and maximal ideals. Let
More informationFinitely generated free Heyting algebras; the well-founded initial segment
Finitely generated free Heyting algebras; the well-founded initial segment R. Elageili and J.K. Truss Department of Pure Mathematics, University of Leeds, Leeds LS2 9JT, UK e-mail yazid98rajab@yahoo.com,
More informationCHAPTER 10. Gentzen Style Proof Systems for Classical Logic
CHAPTER 10 Gentzen Style Proof Systems for Classical Logic Hilbert style systems are easy to define and admit a simple proof of the Completeness Theorem but they are difficult to use. By humans, not mentioning
More informationAlgebraic Logic. Hiroakira Ono Research Center for Integrated Science Japan Advanced Institute of Science and Technology
Algebraic Logic Hiroakira Ono Research Center for Integrated Science Japan Advanced Institute of Science and Technology ono@jaist.ac.jp 1 Introduction Algebraic methods have been important tools in the
More informationTHE REAL NUMBERS Chapter #4
FOUNDATIONS OF ANALYSIS FALL 2008 TRUE/FALSE QUESTIONS THE REAL NUMBERS Chapter #4 (1) Every element in a field has a multiplicative inverse. (2) In a field the additive inverse of 1 is 0. (3) In a field
More informationON PURE REFUTATION FORMULATIONS OF SENTENTIAL LOGICS
Bulletin of the Section of Logic Volume 19/3 (1990), pp. 102 107 reedition 2005 [original edition, pp. 102 107] Tomasz Skura ON PURE REFUTATION FORMULATIONS OF SENTENTIAL LOGICS In [1] J. Lukasiewicz introduced
More informationSolutions to Unique Readability Homework Set 30 August 2011
s to Unique Readability Homework Set 30 August 2011 In the problems below L is a signature and X is a set of variables. Problem 0. Define a function λ from the set of finite nonempty sequences of elements
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 informationON A MINIMAL SYSTEM OF ARISTOTLE S SYLLOGISTIC
Bulletin of the Section of Logic Volume 40:3/4 (0), pp. 9 45 Piotr Kulicki ON A MINIMAL SYSTEM OF ARISTOTLE S SYLLOGISTIC Abstract The system of Syllogistic presented by J. S lupecki is a minimal, Lukasiewicz
More informationPropositional Logic of Continuous Transformations in Cantor Space
Propositional Logic of Continuous Transformations in Cantor Space Grigori Mints Philosophy Department, Stanford University Ting Zhang Computer Science Department, Stanford University 1 Introduction A well-known
More informationOn minimal models of the Region Connection Calculus
Fundamenta Informaticae 69 (2006) 1 20 1 IOS Press On minimal models of the Region Connection Calculus Lirong Xia State Key Laboratory of Intelligent Technology and Systems Department of Computer Science
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 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 informationStable formulas in intuitionistic logic
Stable formulas in intuitionistic logic Nick Bezhanishvili and Dick de Jongh August 14, 2014 Abstract NNIL-formulas are propositional formulas that do not allow nesting of implication to the left. These
More informationThe model companion of the class of pseudo-complemented semilattices is finitely axiomatizable
The model companion of the class of pseudo-complemented semilattices is finitely axiomatizable (joint work with Regula Rupp and Jürg Schmid) Joel Adler joel.adler@phbern.ch Institut S1 Pädagogische Hochschule
More informationA Remark on Propositional Kripke Frames Sound for Intuitionistic Logic
A Remark on Propositional Kripke Frames Sound for Intuitionistic Logic Dmitrij Skvortsov All-Russian Institute of Scientific and Technical Information, VINITI Russian Academy of Science Usievicha, 20,
More informationOn Urquhart s C Logic
On Urquhart s C Logic Agata Ciabattoni Dipartimento di Informatica Via Comelico, 39 20135 Milano, Italy ciabatto@dsiunimiit Abstract In this paper we investigate the basic many-valued logics introduced
More informationCS 486: Applied Logic Lecture 7, February 11, Compactness. 7.1 Compactness why?
CS 486: Applied Logic Lecture 7, February 11, 2003 7 Compactness 7.1 Compactness why? So far, we have applied the tableau method to propositional formulas and proved that this method is sufficient and
More informationMTL-algebras via rotations of basic hoops
MTL-algebras via rotations of basic hoops Sara Ugolini University of Denver, Department of Mathematics (Ongoing joint work with P. Aglianò) 4th SYSMICS Workshop - September 16th 2018 A commutative, integral
More informationFree Weak Nilpotent Minimum Algebras
Algorithms and Complexity Group Institute of Computer Graphics and Algorithms TU Wien, Vienna, Austria April 01 Free Weak Nilpotent Minimum Algebras Stefano Aguzzoli, Simone Bova, and Diego Valota This
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 informationA simple propositional calculus for compact Hausdor spaces
A simple propositional calculus for compact Hausdor spaces G. Bezhanishvili N. Bezhanishvili T. Santoli Y. Venema Abstract We introduce a simple propositional calculus for compact Hausdor spaces. Our approach
More information3.1 Basic properties of real numbers - continuation Inmum and supremum of a set of real numbers
Chapter 3 Real numbers The notion of real number was introduced in section 1.3 where the axiomatic denition of the set of all real numbers was done and some basic properties of the set of all real numbers
More informationCategory O and its basic properties
Category O and its basic properties Daniil Kalinov 1 Definitions Let g denote a semisimple Lie algebra over C with fixed Cartan and Borel subalgebras h b g. Define n = α>0 g α, n = α
More informationClassical Propositional Logic
The Language of A Henkin-style Proof for Natural Deduction January 16, 2013 The Language of A Henkin-style Proof for Natural Deduction Logic Logic is the science of inference. Given a body of information,
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 informationModal systems based on many-valued logics
Modal systems based on many-valued logics F. Bou IIIA - CSIC Campus UAB s/n 08193, Bellaterra, Spain fbou@iiia.csic.es F. Esteva IIIA - CSIC Campus UAB s/n 08193, Bellaterra, Spain esteva@iiia.csic.es
More informationProof Theoretical Reasoning Lecture 3 Modal Logic S5 and Hypersequents
Proof Theoretical Reasoning Lecture 3 Modal Logic S5 and Hypersequents Revantha Ramanayake and Björn Lellmann TU Wien TRS Reasoning School 2015 Natal, Brasil Outline Modal Logic S5 Sequents for S5 Hypersequents
More informationTABLEAU SYSTEM FOR LOGIC OF CATEGORIAL PROPOSITIONS AND DECIDABILITY
Bulletin of the Section of Logic Volume 37:3/4 (2008), pp. 223 231 Tomasz Jarmużek TABLEAU SYSTEM FOR LOGIC OF CATEGORIAL PROPOSITIONS AND DECIDABILITY Abstract In the article we present an application
More informationDisjoint n-amalgamation
October 13, 2015 Varieties of background theme: the role of infinitary logic Goals 1 study n- toward 1 existence/ of atomic models in uncountable cardinals. 2 0-1-laws 2 History, aec, and Neo-stability
More informationSUBALGEBRAS AND HOMOMORPHIC IMAGES OF THE RIEGER-NISHIMURA LATTICE
SUBALGEBRAS AND HOMOMORPHIC IMAGES OF THE RIEGER-NISHIMURA LATTICE Guram Bezhanishvili and Revaz Grigolia Abstract In this note we characterize all subalgebras and homomorphic images of the free cyclic
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 informationThe following techniques for methods of proofs are discussed in our text: - Vacuous proof - Trivial proof
Ch. 1.6 Introduction to Proofs The following techniques for methods of proofs are discussed in our text - Vacuous proof - Trivial proof - Direct proof - Indirect proof (our book calls this by contraposition)
More informationON FUZZY TOPOLOGICAL BCC-ALGEBRAS 1
Discussiones Mathematicae General Algebra and Applications 20 (2000 ) 77 86 ON FUZZY TOPOLOGICAL BCC-ALGEBRAS 1 Wies law A. Dudek Institute of Mathematics Technical University Wybrzeże Wyspiańskiego 27,
More informationABSOLUTE VALUES AND VALUATIONS
ABSOLUTE VALUES AND VALUATIONS YIFAN WU, wuyifan@umich.edu Abstract. We introduce the basis notions, properties and results of absolute values, valuations, discrete valuation rings and higher unit groups.
More informationAN AXIOMATIC FORMATION THAT IS NOT A VARIETY
AN AXIOMATIC FORMATION THAT IS NOT A VARIETY KEITH A. KEARNES Abstract. We show that any variety of groups that contains a finite nonsolvable group contains an axiomatic formation that is not a subvariety.
More informationForcing in Lukasiewicz logic
Forcing in Lukasiewicz logic a joint work with Antonio Di Nola and George Georgescu Luca Spada lspada@unisa.it Department of Mathematics University of Salerno 3 rd MATHLOGAPS Workshop Aussois, 24 th 30
More informationON A PERIOD OF ELEMENTS OF PSEUDO-BCI-ALGEBRAS
Discussiones Mathematicae General Algebra and Applications 35 (2015) 21 31 doi:10.7151/dmgaa.1227 ON A PERIOD OF ELEMENTS OF PSEUDO-BCI-ALGEBRAS Grzegorz Dymek Institute of Mathematics and Computer Science
More informationSome Applications of MATH 1090 Techniques
1 Some Applications of MATH 1090 Techniques 0.1 A simple problem about Nand gates in relation to And gates and inversion (Not) Gates. In this subsection the notation A means that A is proved from the axioms
More informationKrivine s Intuitionistic Proof of Classical Completeness (for countable languages)
Krivine s Intuitionistic Proof of Classical Completeness (for countable languages) Berardi Stefano Valentini Silvio Dip. Informatica Dip. Mat. Pura ed Applicata Univ. Torino Univ. Padova c.so Svizzera
More informationA CLOSURE SYSTEM FOR ELEMENTARY SITUATIONS
Bulletin of the Section of Logic Volume 11:3/4 (1982), pp. 134 138 reedition 2009 [original edition, pp. 134 139] Bogus law Wolniewicz A CLOSURE SYSTEM FOR ELEMENTARY SITUATIONS 1. Preliminaries In [4]
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 informationAn Algebraic Approach to Canonical Formulas: Modal Case
Guram Bezhanishvili Nick Bezhanishvili An Algebraic Approach to Canonical Formulas: Modal Case Dedicated to Ryszard Wójcicki on his 80th birthday Abstract. We introduce relativized modal algebra homomorphisms
More informationProbability Measures in Gödel Logic
Probability Measures in Gödel Logic Diego Valota Department of Computer Science University of Milan valota@di.unimi.it Joint work with Stefano Aguzzoli (UNIMI), Brunella Gerla and Matteo Bianchi (UNINSUBRIA)
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 information2.2 Some Consequences of the Completeness Axiom
60 CHAPTER 2. IMPORTANT PROPERTIES OF R 2.2 Some Consequences of the Completeness Axiom In this section, we use the fact that R is complete to establish some important results. First, we will prove that
More informationSequences of height 1 primes in Z[X]
Sequences of height 1 primes in Z[X] Stephen McAdam Department of Mathematics University of Texas Austin TX 78712 mcadam@math.utexas.edu Abstract: For each partition J K of {1, 2,, n} (n 2) with J 2, let
More informationAdding truth-constants to logics of continuous t-norms: axiomatization and completeness results
Adding truth-constants to logics of continuous t-norms: axiomatization and completeness results Francesc Esteva, Lluís Godo, Carles Noguera Institut d Investigació en Intel ligència Artificial - CSIC Catalonia,
More informationAxiomatisation of Hybrid Logic
Imperial College London Department of Computing Axiomatisation of Hybrid Logic by Louis Paternault Submitted in partial fulfilment of the requirements for the MSc Degree in Advanced Computing of Imperial
More informationEuler s, Fermat s and Wilson s Theorems
Euler s, Fermat s and Wilson s Theorems R. C. Daileda February 17, 2018 1 Euler s Theorem Consider the following example. Example 1. Find the remainder when 3 103 is divided by 14. We begin by computing
More informationMadhavan Mukund Chennai Mathematical Institute
AN INTRODUCTION TO LOGIC Madhavan Mukund Chennai Mathematical Institute E-mail: madhavan@cmiacin Abstract ese are lecture notes for an introductory course on logic aimed at graduate students in Computer
More informationUNIVERSITY OF EAST ANGLIA. School of Mathematics UG End of Year Examination MATHEMATICAL LOGIC WITH ADVANCED TOPICS MTH-4D23
UNIVERSITY OF EAST ANGLIA School of Mathematics UG End of Year Examination 2003-2004 MATHEMATICAL LOGIC WITH ADVANCED TOPICS Time allowed: 3 hours Attempt Question ONE and FOUR other questions. Candidates
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 informationSyntactic Characterisations in Model Theory
Department of Mathematics Bachelor Thesis (7.5 ECTS) Syntactic Characterisations in Model Theory Author: Dionijs van Tuijl Supervisor: Dr. Jaap van Oosten June 15, 2016 Contents 1 Introduction 2 2 Preliminaries
More informationOn Modal Logics of Partial Recursive Functions
arxiv:cs/0407031v1 [cs.lo] 12 Jul 2004 On Modal Logics of Partial Recursive Functions Pavel Naumov Computer Science Pennsylvania State University Middletown, PA 17057 naumov@psu.edu June 14, 2018 Abstract
More informationFirst-Order Theorem Proving and Vampire
First-Order Theorem Proving and Vampire Laura Kovács 1,2 and Martin Suda 2 1 TU Wien 2 Chalmers Outline Introduction First-Order Logic and TPTP Inference Systems Saturation Algorithms Redundancy Elimination
More informationSemilattice Modes II: the amalgamation property
Semilattice Modes II: the amalgamation property Keith A. Kearnes Abstract Let V be a variety of semilattice modes with associated semiring R. We prove that if R is a bounded distributive lattice, then
More informationEquational Logic. Chapter 4
Chapter 4 Equational Logic From now on First-order Logic is considered with equality. In this chapter, I investigate properties of a set of unit equations. For a set of unit equations I write E. Full first-order
More informationAXIOMATIZATION OF THE SENTENTIAL LOGIC DUAL TO SOBOCIŃSKI S n-valued LOGIC
Bulletin of the Section of Logic Volume 40:1/2 (2011), pp. 47 54 Anetta Górnicka AXIOMATIZATION OF THE SENTENTIAL LOGIC DUAL TO SOBOCIŃSKI S n-valued LOGIC Abstract In [4] we introduced the sentential
More informationComputability Theoretic Properties of Injection Structures
Computability Theoretic Properties of Injection Structures Douglas Cenzer 1, Valentina Harizanov 2 and Jeffrey B. Remmel 3 Abstract We study computability theoretic properties of computable injection structures
More informationPrinciples of Real Analysis I Fall I. The Real Number System
21-355 Principles of Real Analysis I Fall 2004 I. The Real Number System The main goal of this course is to develop the theory of real-valued functions of one real variable in a systematic and rigorous
More informationSubdirectly Irreducible Modes
Subdirectly Irreducible Modes Keith A. Kearnes Abstract We prove that subdirectly irreducible modes come in three very different types. From the description of the three types we derive the results that
More informationSubminimal Logics and Relativistic Negation
School of Information Science, JAIST March 2, 2018 Outline 1 Background Minimal Logic Subminimal Logics 2 Some More 3 Minimal Logic Subminimal Logics Outline 1 Background Minimal Logic Subminimal Logics
More informationFilters in Analysis and Topology
Filters in Analysis and Topology David MacIver July 1, 2004 Abstract The study of filters is a very natural way to talk about convergence in an arbitrary topological space, and carries over nicely into
More informationKreisel s Conjecture with minimality principle
Kreisel s Conjecture with minimality principle Pavel Hrubeš November 9, 2008 Abstract We prove that Kreisel s Conjecture is true, if Peano arithmetic is axiomatised using minimality principle and axioms
More information