CHAPTER 11. Introduction to Intuitionistic Logic

Size: px
Start display at page:

Download "CHAPTER 11. Introduction to Intuitionistic Logic"

Transcription

1 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 by L. E. J. Brouwer in The first Hilbert style formalization of the intuitionistic logic, formulated as a proof system, is due to A. Heyting (1930). In this chapter we present a Hilbert style proof system that is equivalent to the Heyting s original formalization and discuss the relationship between intuitionistic and classical logic. There have been, of course, several successful attempts at creating semantics for the intuitionistic logic, and hence to define formally a notion of the intuitionistic tautology. The most known are Kripke models and topological and algebraic models. Kripke models were defined by Kripke in The topological and algebraic models were initiated by Stone and Tarski in 1937, 1938, respectively. An uniform theory and presentation of topological and algebraic models was given by Rasiowa and Sikorski in We present both approaches, Kripke and Rasiowa and Sikorski in the respective chapters on Kripke and Algebraic Models. We also give there the respective proofs of the Completeness Theorem for the proof systems presented in this section. The goal of this chapter is to give a presentation of the intuitionistic logic formulated as a proof system and discuss the basic theorems that establish the relationship between classical and intuitionistic logics. 1 Philosophical Motivation Intuitionists view-point on the meaning of the basic logical and set theoretical concepts used in mathematics is different from that of most mathematicians in their research. The basic difference lies in the interpretation of the word exists. For example, let A(x) be a statement in the arithmetic of natural numbers. For the mathematicians the sentence xa(x) (1) is true if it is a theorem of arithmetic, i.e. if it can be deduced from the axioms of arithmetic by means of classical logic. If a mathematician proves sentence 1

2 ( 1), this does not mean that he is able to indicate a method of construction of a natural number n such that A(n) holds. For the intuitionist the sentence ( 1) is true only he is able to provide a constructive method of finding a number n such that A(n) is true. Moreover, the mathematician often obtains the proof of the existential sentence ( 1), i.e. of the sentence xa(x) by proving first a sentence x A(x). (2) Next he makes use of a classical tautology ( x A(x)) xa(x)). (3) By applying Modus Ponens to ( 2) and ( 3) he obtains ( 1). For the intuitionist such method is not acceptable, for it does not give any method of constructing a number n such that A(n) holds. For this reason the intuitionist do not accept the classical tautology ( 3) i.e. ( x A(x)) xa(x)) as intuitionistic tautology, or as as an intuitionistically provable sentence. Let us denote by I A and = I A the fact that A is intuitionistically provable and intuitionistic tautology, respectively. The proof system I for the intuitionistic logic has hence to be such that I ( x A(x)) xa(x)). The intuitionistic semantics or definition of intuitionistic model I has to be such that one can prove in that also = I ( x A(x)) xa(x)). The above means also that intuitionists interpret differently the meaning of propositional connectives. Intuitionistic implication The intuitionistic implication (A B) is considered by to be true if there exists a method by which a proof of B can be deduced from the proof of A. In the case of the implication ( x A(x)) xa(x)) there is no general method which, from a proof of the sentence ( x A(x)), permits is to obtain an intuitionistic proof of the sentence xa(x), i.e. to construct a number n such that A(n) holds, hence we can t accept it as an intuitionistic theorem or tautology. 2

3 Intuitionistic negation The negation and the disjunction are also understood differently. The sentence A is considered intuitionistically true if the acceptance of the sentence A leads to absurdity. As a result of above understanding of negation and implication we have that in the intuitionistic logic I I (A A) but I ( A A). Consequently, in any intuitionistic model I, and = I (A A) = I ( A A). Intuitionistic disjunction The intuitionist regards a disjunction (A B) as true if one of the sentences A, B is true and there is a method by which it is possible to find out which of them is true. As a consequence a classical law of excluded middle (A A) is not acceptable by the intuitionists since there is no general method of finding out, for any given sentence A, whether A or A is true. This means that the intuitionistic logic must be such that and I (A A) = I (A A). Intuitionists view of the concept of infinite set also differs from that which is generally accepted in mathematics. Intuitionists reject the idea of infinite set as a closed whole. They look upon an infinite set as something which is constantly in a state of formation. Thus, for example, the set of all natural numbers is infinite in the sense that to any given finite set of natural numbers it is always possible to add one more natural number. The notion of the set of all subsets of the set of all natural numbers is not regarded meaningful. Thus intuitionists reject the general idea of a set as defined by a modern set theory. 3

4 An exact exposition of the basic ideas of intuitionism is outside the range of our investigations. Our goal is to give a presentation of of the intuitionistic logic, which is a sort of reflection of intuitionistic ideas formulated as a proof system. 2 Hilbert System for Intuitionistic Propositional Logic Language We adopt a propositional language L = L {,,, } with the set of formulas denoted by F. Axioms The set of logical axioms of the Hilbert style proof system for intuitionistic logic consists of all formulas of the forms A1 A2 A3 A4 A5 A6 A7 A8 A9 A10 A11 ((A B) ((B C) (A C))), (A (A B)), (B (A B)), ((A C) ((B C) ((A B) C))), ((A B) A), ((A B) B), ((C A) ((C B) (C (A B))), ((A (B C)) ((A B) C)), (((A B) C) (A (B C)), (A A) B), ((A (A A)) A), where A, B, C are any formulas in L. Rules of inference We adopt a Modus Ponens rule 4

5 (MP) A ; (A B) B as the only inference rule. Proof system I A proof system I = ( L, F A1 A11, (MP) ), for L, A1 - A11 defined above, is called a Hilbert Style Formalization for Intuitionistic Propositional Logic. The above set of axioms is due to Rasiowa (1959). It differs from Heyting s original set of axioms but they are equivalent. We introduce, as usual, the notion of a formal proof in I and denote by I A the fact that A has a formal proof in I, or that that A is provable. intuitionistically 2.1 Completeness Theorem for I There are several ways one can define a semantics for the intuitionistic logic, i.e. the semantics for a Heyting proof system or for its equivalent form I. It means it is possible to define a notion of intuitionistic tautology in a way that the system I (and hence the equivalent original Heyting system) is a complete proof systems under this notion. This notion of tautology will be defined formally and discussed later. moment we denote by = I A For a the fact that A is an intuitionistic tautology and state that the following theorem holds. Theorem 2.1 ( Completeness Theorem for I ) For any formula A F, I A ı and only if = I A. 5

6 The Completeness Theorem gives us the right to replace the notion of a theorem of a given intuitionistic proof system by a more general (independent of the proof system) and intuitive (we all have some notion of truthfulness) notion of the intuitionistic tautology. The intuitionistic logic has been created as a rival to the classical one. So a question about the relationship between these two is a natural one. We present here some examples of tautologies and some historic results about the connection between the classical and intuitionistic logic. In this the way we can form some intuitions about what the intuitionistic tautology really is, even if we haven t defined it yet. 2.2 Examples of intuitionistic propositional tautologies The following classical tautologies are provable in I and hence are also intuitionistic tautologies. (A A), (4) (A (B A)), (5) (A (B (A B))), (6) ((A (B C)) ((A B) (A C))), (7) (A A), (8) (A A), (9) (( A B) (A B)), (10) ( (A B) ( A B)), (11) (( A B) ( (A B)), (12) (( A B) ( A B)), (13) ((A B) ( B A)), (14) ((A B) (B A)), (15) ( A A), (16) ( A A), (17) ( (A B) (A B)), (18) ((C A) ((C (A B)) (C B)), (19) 6

7 2.3 Examples of classical tautologies that are not intuitionistic tautologies The following classical tautologies are not intuitionistic tautologies. Homework Exercise (A A), (20) ( A A), (21) ((A B) ( A B)), (22) ( (A B) ( A B)), (23) (( A B) ( B A)), (24) (( A B) (B A)), (25) ((A B) A) A), (26) The algebraic models for the intuitionistic logic are defined in terms of Pseudo- Boolean Algebras in the following way. A formula A is said to be an intuitionistic tautology if and only if v = A, for all v and all Pseudo-Boolean Algebras, where v maps V AR into universe of a Pseudo-Boolean Algebra. I.e. A is an intuitionistic tautology if and only if it is true in all Pseudo-Boolean Algebras under all possible variable assignments. A 3 element Heyting algebra as defined in the section Some three valued logics is a 3 element Pseudo-Boolean Algebra. 1. Show that the 3 element Heyting algebra is a model for all formulas ( 4) - ( 19). 2. Find for which of the formulas ( 20) - ( 26) it acts as a counter-model. 3 Connection Between Classical and Intuitionistic Tautologies The first connection is quite obvious. Let us observe that if we add the axiom A12 (A A) to the set of axioms of our system I we obtain a complete Hilbert proof system C for the classical logic. This proves the following. 7

8 Theorem 3.1 Every formula that is derivable intuitionistically is classically derivable, i.e. if I A, then A, where we use symbol for classical (complete classical proof system) provability. We write and = A = I A to denote that A is a classical and intuitionistic tautology, respectively. As both proof systems, I and C are complete under respective semantics, we can state this as the following relationship between classical and intuitionistic tautologies. Theorem 3.2 For any formula A F, if = I A, then = A. The next relationship shows how to obtain intuitionistic tautologies from the classical tautologies and vice versa. It has been proved by Glivenko in 1929 and independently by Tarski in Theorem 3.3 (Glivenko ) For any formula A F, A is a classically provable if and only if A is an intuitionistically provable, i.e. I A iff A where we use symbol for classical (complete classical proof system) provability. Theorem 3.4 (Tarski) For any formula A F, A is a classical tautology if and only if A is an intuitionistic tautology, i.e. = A if and only if = I A. The following relationships were proved by Gödel in

9 Theorem 3.5 (Gödel) For any A, B F, a formula (A B) is a classically provable if and only if it is an intuitionistically provable, i.e. (A B) if and only if I (A B). Theorem 3.6 (Gödel) If a formula A contains no connectives except and, then A is a classically provable if and only if it is an intuitionistically provable. By the Completeness Theorems for classical and intuitionisctic logics we get the following equivalent semantic form of theorems 3.5and 3.6. Theorem 3.7 A formula (A B) is a classical tautology if and only if it is an intuitionistic tautology, i.e. = (A B) if and only if = I (A B). Theorem 3.8 If a formula A contains no connectives except and, then A is a classical tautology if and only if it is an intuitionistic tautology. 3.1 On intuitionistically derivable disjunction In a classical logic it is possible for the disjunction (A B) to be a tautology when neither A nor B is a tautology. The tautology (A A) is the simplest example. This does not hold for the intuitionistic logic. This fact was stated without the proof by Gödel in 1931 and proved by Gentzen in 1935 via his proof system LI which is presented and discussed in chapter 12. Theorem 3.9 A disjunction (A B) is intuitionistically provable if and only if either A or B is intuitionistically provable, i.e. I (A B) if and only if I A or I B. We obtain, via the Completeness Theorem 2.1 the following equivalent semantic version of the above, 9

10 Theorem 3.10 A disjunction (A B) is intuitionistic tautology if and only if either A or B is intuitionistic tautology, i.e. = I (A B) if and only if = I A or = I B. 10

cse371/mat371 LOGIC Professor Anita Wasilewska Fall 2018

cse371/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 information

CHAPTER 7. Introduction to Intuitionistic and Modal Logics. 1 Introduction to Intuitionictic Logic

CHAPTER 7. Introduction to Intuitionistic and Modal Logics. 1 Introduction to Intuitionictic Logic CHAPTER 7 ch7 Introduction to Intuitionistic and Modal Logics 1 Introduction to Intuitionictic Logic Intuitionistic logic has developed as a result of certain philosophical views on the foundation of mathematics,

More information

Chapter 11: Automated Proof Systems (1)

Chapter 11: Automated Proof Systems (1) Chapter 11: Automated Proof Systems (1) SYSTEM RS OVERVIEW Hilbert style systems are easy to define and admit a simple proof of the Completeness Theorem but they are difficult to use. Automated systems

More information

CHAPTER 10. Gentzen Style Proof Systems for Classical Logic

CHAPTER 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 information

Chapter 11: Automated Proof Systems

Chapter 11: Automated Proof Systems Chapter 11: Automated Proof Systems SYSTEM RS OVERVIEW Hilbert style systems are easy to define and admit a simple proof of the Completeness Theorem but they are difficult to use. Automated systems are

More information

02 Propositional Logic

02 Propositional Logic SE 2F03 Fall 2005 02 Propositional Logic Instructor: W. M. Farmer Revised: 25 September 2005 1 What is Propositional Logic? Propositional logic is the study of the truth or falsehood of propositions or

More information

Propositional Logics and their Algebraic Equivalents

Propositional Logics and their Algebraic Equivalents Propositional Logics and their Algebraic Equivalents Kyle Brooks April 18, 2012 Contents 1 Introduction 1 2 Formal Logic Systems 1 2.1 Consequence Relations......................... 2 3 Propositional Logic

More information

Př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 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 information

Marie Duží

Marie Duží Marie Duží marie.duzi@vsb.cz 1 Formal systems, Proof calculi A proof calculus (of a theory) is given by: 1. a language 2. a set of axioms 3. a set of deduction rules ad 1. The definition of a language

More information

Rasiowa-Sikorski proof system for the non-fregean sentential logic SCI

Rasiowa-Sikorski proof system for the non-fregean sentential logic SCI Rasiowa-Sikorski proof system for the non-fregean sentential logic SCI Joanna Golińska-Pilarek National Institute of Telecommunications, Warsaw, J.Golinska-Pilarek@itl.waw.pl We will present complete and

More information

KRIPKE S THEORY OF TRUTH 1. INTRODUCTION

KRIPKE 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 information

CHAPTER 2 INTRODUCTION TO CLASSICAL PROPOSITIONAL LOGIC

CHAPTER 2 INTRODUCTION TO CLASSICAL PROPOSITIONAL LOGIC CHAPTER 2 INTRODUCTION TO CLASSICAL PROPOSITIONAL LOGIC 1 Motivation and History The origins of the classical propositional logic, classical propositional calculus, as it was, and still often is called,

More information

CHAPTER 4 CLASSICAL PROPOSITIONAL SEMANTICS

CHAPTER 4 CLASSICAL PROPOSITIONAL SEMANTICS CHAPTER 4 CLASSICAL PROPOSITIONAL SEMANTICS 1 Language There are several propositional languages that are routinely called classical propositional logic languages. It is due to the functional dependency

More information

BASIC INTUITIONISTIC PRINCIPLES IN FUZZY SET THEORIES AND ITS EXTENSIONS

BASIC INTUITIONISTIC PRINCIPLES IN FUZZY SET THEORIES AND ITS EXTENSIONS BASIC INTUITIONISTIC PRINCIPLES IN FUZZY SET THEORIES AND ITS EXTENSIONS (A TERMINOLOGICAL DEBATE ON ATANASSOV IFS) GIANPIERO CATTANEO AND DAVIDE CIUCCI Abstract. In this paper we contribute to the terminological

More information

Logic for Computer Science - Week 4 Natural Deduction

Logic for Computer Science - Week 4 Natural Deduction Logic for Computer Science - Week 4 Natural Deduction 1 Introduction In the previous lecture we have discussed some important notions about the semantics of propositional logic. 1. the truth value of a

More information

Introduction to Logic

Introduction to Logic Introduction to Logic 1 What is Logic? The word logic comes from the Greek logos, which can be translated as reason. Logic as a discipline is about studying the fundamental principles of how to reason

More information

185.A09 Advanced Mathematical Logic

185.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

Notes on the Foundations of Constructive Mathematics

Notes on the Foundations of Constructive Mathematics Notes on the Foundations of Constructive Mathematics by Joan Rand Moschovakis December 27, 2004 1 Background and Motivation The constructive tendency in mathematics has deep roots. Most mathematicians

More information

Applied Logic. Lecture 1 - Propositional logic. Marcin Szczuka. Institute of Informatics, The University of Warsaw

Applied Logic. Lecture 1 - Propositional logic. Marcin Szczuka. Institute of Informatics, The University of Warsaw Applied Logic Lecture 1 - Propositional logic Marcin Szczuka Institute of Informatics, The University of Warsaw Monographic lecture, Spring semester 2017/2018 Marcin Szczuka (MIMUW) Applied Logic 2018

More information

Manual of Logical Style

Manual of Logical Style Manual of Logical Style Dr. Holmes January 9, 2015 Contents 1 Introduction 2 2 Conjunction 3 2.1 Proving a conjunction...................... 3 2.2 Using a conjunction........................ 3 3 Implication

More information

Natural Deduction. Formal Methods in Verification of Computer Systems Jeremy Johnson

Natural Deduction. Formal Methods in Verification of Computer Systems Jeremy Johnson Natural Deduction Formal Methods in Verification of Computer Systems Jeremy Johnson Outline 1. An example 1. Validity by truth table 2. Validity by proof 2. What s a proof 1. Proof checker 3. Rules of

More information

An Introduction to Modal Logic III

An Introduction to Modal Logic III An Introduction to Modal Logic III Soundness of Normal Modal Logics Marco Cerami Palacký University in Olomouc Department of Computer Science Olomouc, Czech Republic Olomouc, October 24 th 2013 Marco Cerami

More information

Introduction to Metalogic

Introduction to Metalogic Philosophy 135 Spring 2008 Tony Martin Introduction to Metalogic 1 The semantics of sentential logic. The language L of sentential logic. Symbols of L: Remarks: (i) sentence letters p 0, p 1, p 2,... (ii)

More information

Chapter 4: Classical Propositional Semantics

Chapter 4: Classical Propositional Semantics Chapter 4: Classical Propositional Semantics Language : L {,,, }. Classical Semantics assumptions: TWO VALUES: there are only two logical values: truth (T) and false (F), and EXTENSIONALITY: the logical

More information

Truth, Subderivations and the Liar. Why Should I Care about the Liar Sentence? Uses of the Truth Concept - (i) Disquotation.

Truth, Subderivations and the Liar. Why Should I Care about the Liar Sentence? Uses of the Truth Concept - (i) Disquotation. Outline 1 2 3 4 5 1 / 41 2 / 41 The Liar Sentence Let L be the sentence: This sentence is false This sentence causes trouble If it is true, then it is false So it can t be true Thus, it is false If it

More information

Nonclassical logics (Nichtklassische Logiken)

Nonclassical logics (Nichtklassische Logiken) Nonclassical logics (Nichtklassische Logiken) VU 185.249 (lecture + exercises) http://www.logic.at/lvas/ncl/ Chris Fermüller Technische Universität Wien www.logic.at/people/chrisf/ chrisf@logic.at Winter

More information

LOGIC OF CLASSICAL REFUTABILITY AND CLASS OF EXTENSIONS OF MINIMAL LOGIC

LOGIC 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 information

1 Completeness Theorem for First Order Logic

1 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 information

Conjunction: p q is true if both p, q are true, and false if at least one of p, q is false. The truth table for conjunction is as follows.

Conjunction: p q is true if both p, q are true, and false if at least one of p, q is false. The truth table for conjunction is as follows. Chapter 1 Logic 1.1 Introduction and Definitions Definitions. A sentence (statement, proposition) is an utterance (that is, a string of characters) which is either true (T) or false (F). A predicate is

More information

Positive provability logic

Positive provability logic Positive provability logic Lev Beklemishev Steklov Mathematical Institute Russian Academy of Sciences, Moscow November 12, 2013 Strictly positive modal formulas The language of modal logic extends that

More information

Propositional logic (revision) & semantic entailment. p. 1/34

Propositional logic (revision) & semantic entailment. p. 1/34 Propositional logic (revision) & semantic entailment p. 1/34 Reading The background reading for propositional logic is Chapter 1 of Huth/Ryan. (This will cover approximately the first three lectures.)

More information

Krivine s Intuitionistic Proof of Classical Completeness (for countable languages)

Krivine 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 information

Logic Part II: Intuitionistic Logic and Natural Deduction

Logic Part II: Intuitionistic Logic and Natural Deduction Yesterday Remember yesterday? classical logic: reasoning about truth of formulas propositional logic: atomic sentences, composed by connectives validity and satisability can be decided by truth tables

More information

Introduction to Intuitionistic Logic

Introduction to Intuitionistic Logic Introduction to Intuitionistic Logic August 31, 2016 We deal exclusively with propositional intuitionistic logic. The language is defined as follows. φ := p φ ψ φ ψ φ ψ φ := φ and φ ψ := (φ ψ) (ψ φ). A

More information

Gödel s Incompleteness Theorems

Gödel s Incompleteness Theorems Seminar Report Gödel s Incompleteness Theorems Ahmet Aspir Mark Nardi 28.02.2018 Supervisor: Dr. Georg Moser Abstract Gödel s incompleteness theorems are very fundamental for mathematics and computational

More information

Semantics of intuitionistic propositional logic

Semantics 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 information

a. ~p : if p is T, then ~p is F, and vice versa

a. ~p : if p is T, then ~p is F, and vice versa Lecture 10: Propositional Logic II Philosophy 130 3 & 8 November 2016 O Rourke & Gibson I. Administrative A. Group papers back to you on November 3. B. Questions? II. The Meaning of the Conditional III.

More information

Logic: Propositional Logic (Part I)

Logic: Propositional Logic (Part I) Logic: Propositional Logic (Part I) Alessandro Artale Free University of Bozen-Bolzano Faculty of Computer Science http://www.inf.unibz.it/ artale Descrete Mathematics and Logic BSc course Thanks to Prof.

More information

Introduction to Metalogic

Introduction to Metalogic Introduction to Metalogic Hans Halvorson September 21, 2016 Logical grammar Definition. A propositional signature Σ is a collection of items, which we call propositional constants. Sometimes these propositional

More information

cse541 LOGIC FOR COMPUTER SCIENCE

cse541 LOGIC FOR COMPUTER SCIENCE cse541 LOGIC FOR COMPUTER SCIENCE Professor Anita Wasilewska Spring 2015 LECTURE 2 Chapter 2 Introduction to Classical Propositional Logic PART 1: Classical Propositional Model Assumptions PART 2: Syntax

More information

Basic Algebraic Logic

Basic 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 information

Algebraic 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 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 information

The Importance of Being Formal. Martin Henz. February 5, Propositional Logic

The Importance of Being Formal. Martin Henz. February 5, Propositional Logic The Importance of Being Formal Martin Henz February 5, 2014 Propositional Logic 1 Motivation In traditional logic, terms represent sets, and therefore, propositions are limited to stating facts on sets

More information

Natural Deduction for Propositional Logic

Natural Deduction for Propositional Logic Natural Deduction for Propositional Logic Bow-Yaw Wang Institute of Information Science Academia Sinica, Taiwan September 10, 2018 Bow-Yaw Wang (Academia Sinica) Natural Deduction for Propositional Logic

More information

1 FUNDAMENTALS OF LOGIC NO.10 HERBRAND THEOREM Tatsuya Hagino hagino@sfc.keio.ac.jp lecture URL https://vu5.sfc.keio.ac.jp/slide/ 2 So Far Propositional Logic Logical connectives (,,, ) Truth table Tautology

More information

Rules of Inference. Lecture 1 Tuesday, September 24. Rosalie Iemhoff Utrecht University, The Netherlands

Rules of Inference. Lecture 1 Tuesday, September 24. Rosalie Iemhoff Utrecht University, The Netherlands Rules of Inference Lecture 1 Tuesday, September 24 Rosalie Iemhoff Utrecht University, The Netherlands TbiLLC 2013 Gudauri, Georgia, September 23-27, 2013 1 / 26 Questions Given a theorem, what are the

More information

Chapter 2: Introduction to Propositional Logic

Chapter 2: Introduction to Propositional Logic Chapter 2: Introduction to Propositional Logic PART ONE: History and Motivation Origins: Stoic school of philosophy (3rd century B.C.), with the most eminent representative was Chryssipus. Modern Origins:

More information

Glossary of Logical Terms

Glossary of Logical Terms Math 304 Spring 2007 Glossary of Logical Terms The following glossary briefly describes some of the major technical logical terms used in this course. The glossary should be read through at the beginning

More information

Informal Statement Calculus

Informal 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 information

Hilbert s problems, Gödel, and the limits of computation

Hilbert s problems, Gödel, and the limits of computation Hilbert s problems, Gödel, and the limits of computation Logan Axon Gonzaga University November 14, 2013 Hilbert at the ICM At the 1900 International Congress of Mathematicians in Paris, David Hilbert

More information

... The Sequel. a.k.a. Gödel's Girdle

... The Sequel. a.k.a. Gödel's Girdle ... The Sequel a.k.a. Gödel's Girdle Formal Systems A Formal System for a mathematical theory consists of: 1. A complete list of the symbols to be used. 2. Rules of syntax The rules that determine properly

More information

22c:145 Artificial Intelligence

22c:145 Artificial Intelligence 22c:145 Artificial Intelligence Fall 2005 Propositional Logic Cesare Tinelli The University of Iowa Copyright 2001-05 Cesare Tinelli and Hantao Zhang. a a These notes are copyrighted material and may not

More information

15414/614 Optional Lecture 1: Propositional Logic

15414/614 Optional Lecture 1: Propositional Logic 15414/614 Optional Lecture 1: Propositional Logic Qinsi Wang Logic is the study of information encoded in the form of logical sentences. We use the language of Logic to state observations, to define concepts,

More information

EECS 1028 M: Discrete Mathematics for Engineers

EECS 1028 M: Discrete Mathematics for Engineers EECS 1028 M: Discrete Mathematics for Engineers Suprakash Datta Office: LAS 3043 Course page: http://www.eecs.yorku.ca/course/1028 Also on Moodle S. Datta (York Univ.) EECS 1028 W 18 1 / 12 Using the laws

More information

On Urquhart s C Logic

On 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 information

MONADIC FRAGMENTS OF INTUITIONISTIC CONTROL LOGIC

MONADIC 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 information

Mat 243 Exam 1 Review

Mat 243 Exam 1 Review OBJECTIVES (Review problems: on next page) 1.1 Distinguish between propositions and non-propositions. Know the truth tables (i.e., the definitions) of the logical operators,,,, and Write truth tables for

More information

Propositional and Predicate Logic - VII

Propositional and Predicate Logic - VII Propositional and Predicate Logic - VII Petr Gregor KTIML MFF UK WS 2015/2016 Petr Gregor (KTIML MFF UK) Propositional and Predicate Logic - VII WS 2015/2016 1 / 11 Theory Validity in a theory A theory

More information

Maximal Introspection of Agents

Maximal Introspection of Agents Electronic Notes in Theoretical Computer Science 70 No. 5 (2002) URL: http://www.elsevier.nl/locate/entcs/volume70.html 16 pages Maximal Introspection of Agents Thomas 1 Informatics and Mathematical Modelling

More information

Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes

Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes These notes form a brief summary of what has been covered during the lectures. All the definitions must be memorized and understood. Statements

More information

Propositional Logic: Syntax

Propositional Logic: Syntax 4 Propositional Logic: Syntax Reading: Metalogic Part II, 22-26 Contents 4.1 The System PS: Syntax....................... 49 4.1.1 Axioms and Rules of Inference................ 49 4.1.2 Definitions.................................

More information

On the Complexity of the Reflected Logic of Proofs

On the Complexity of the Reflected Logic of Proofs On the Complexity of the Reflected Logic of Proofs Nikolai V. Krupski Department of Math. Logic and the Theory of Algorithms, Faculty of Mechanics and Mathematics, Moscow State University, Moscow 119899,

More information

Chapter 3: Propositional Calculus: Deductive Systems. September 19, 2008

Chapter 3: Propositional Calculus: Deductive Systems. September 19, 2008 Chapter 3: Propositional Calculus: Deductive Systems September 19, 2008 Outline 1 3.1 Deductive (Proof) System 2 3.2 Gentzen System G 3 3.3 Hilbert System H 4 3.4 Soundness and Completeness; Consistency

More information

Realizable Extensions of Intuitionistic Analysis: Brouwer, Kleene, Kripke and the End of Time

Realizable Extensions of Intuitionistic Analysis: Brouwer, Kleene, Kripke and the End of Time Realizable Extensions of Intuitionistic Analysis: Brouwer, Kleene, Kripke and the End of Time Joan Rand Moschovakis Occidental College, Emerita ASL Special Session on Intuitionism and Intuitionistic Logic

More information

First Order Logic: Syntax and Semantics

First Order Logic: Syntax and Semantics CS1081 First Order Logic: Syntax and Semantics COMP30412 Sean Bechhofer sean.bechhofer@manchester.ac.uk Problems Propositional logic isn t very expressive As an example, consider p = Scotland won on Saturday

More information

Mathematics 114L Spring 2018 D.A. Martin. Mathematical Logic

Mathematics 114L Spring 2018 D.A. Martin. Mathematical Logic Mathematics 114L Spring 2018 D.A. Martin Mathematical Logic 1 First-Order Languages. Symbols. All first-order languages we consider will have the following symbols: (i) variables v 1, v 2, v 3,... ; (ii)

More information

EXERCISE 10 SOLUTIONS

EXERCISE 10 SOLUTIONS CSE541 EXERCISE 10 SOLUTIONS Covers Chapters 10, 11, 12 Read and learn all examples and exercises in the chapters as well! QUESTION 1 Let GL be the Gentzen style proof system for classical logic defined

More information

Deductive Systems. Lecture - 3

Deductive Systems. Lecture - 3 Deductive Systems Lecture - 3 Axiomatic System Axiomatic System (AS) for PL AS is based on the set of only three axioms and one rule of deduction. It is minimal in structure but as powerful as the truth

More information

Philosophy of Mathematics Intuitionism

Philosophy of Mathematics Intuitionism Philosophy of Mathematics Intuitionism Owen Griffiths oeg21@cam.ac.uk St John s College, Cambridge 01/12/15 Classical mathematics Consider the Pythagorean argument that 2 is irrational: 1. Assume that

More information

BETWEEN THE LOGIC OF PARMENIDES AND THE LOGIC OF LIAR

BETWEEN THE LOGIC OF PARMENIDES AND THE LOGIC OF LIAR Bulletin of the Section of Logic Volume 38:3/4 (2009), pp. 123 133 Kordula Świȩtorzecka BETWEEN THE LOGIC OF PARMENIDES AND THE LOGIC OF LIAR Abstract In the presented text we shall focus on some specific

More information

Modal Logic XX. Yanjing Wang

Modal Logic XX. Yanjing Wang Modal Logic XX Yanjing Wang Department of Philosophy, Peking University May 6th, 2016 Advanced Modal Logic (2016 Spring) 1 Completeness A traditional view of Logic A logic Λ is a collection of formulas

More information

Language of Propositional Logic

Language of Propositional Logic Logic A logic has: 1. An alphabet that contains all the symbols of the language of the logic. 2. A syntax giving the rules that define the well formed expressions of the language of the logic (often called

More information

An Introduction to Modal Logic I

An Introduction to Modal Logic I An Introduction to Modal Logic I Introduction and Historical remarks Marco Cerami Palacký University in Olomouc Department of Computer Science Olomouc, Czech Republic Olomouc, October 10 th 2013 Marco

More information

Structuring Logic with Sequent Calculus

Structuring Logic with Sequent Calculus Structuring Logic with Sequent Calculus Alexis Saurin ENS Paris & École Polytechnique & CMI Seminar at IIT Delhi 17th September 2004 Outline of the talk Proofs via Natural Deduction LK Sequent Calculus

More information

Propositional Logic Language

Propositional Logic Language Propositional Logic Language A logic consists of: an alphabet A, a language L, i.e., a set of formulas, and a binary relation = between a set of formulas and a formula. An alphabet A consists of a finite

More information

Gödel s Completeness Theorem

Gödel s Completeness Theorem A.Miller M571 Spring 2002 Gödel s Completeness Theorem We only consider countable languages L for first order logic with equality which have only predicate symbols and constant symbols. We regard the symbols

More information

Sample Problems for all sections of CMSC250, Midterm 1 Fall 2014

Sample Problems for all sections of CMSC250, Midterm 1 Fall 2014 Sample Problems for all sections of CMSC250, Midterm 1 Fall 2014 1. Translate each of the following English sentences into formal statements using the logical operators (,,,,, and ). You may also use mathematical

More information

GÖDEL S COMPLETENESS AND INCOMPLETENESS THEOREMS. Contents 1. Introduction Gödel s Completeness Theorem

GÖDEL S COMPLETENESS AND INCOMPLETENESS THEOREMS. Contents 1. Introduction Gödel s Completeness Theorem GÖDEL S COMPLETENESS AND INCOMPLETENESS THEOREMS BEN CHAIKEN Abstract. This paper will discuss the completeness and incompleteness theorems of Kurt Gödel. These theorems have a profound impact on the philosophical

More information

Propositional Dynamic Logic

Propositional Dynamic Logic Propositional Dynamic Logic Contents 1 Introduction 1 2 Syntax and Semantics 2 2.1 Syntax................................. 2 2.2 Semantics............................... 2 3 Hilbert-style axiom system

More information

UNIVERSITY 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 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 information

Axiomatic set theory. Chapter Why axiomatic set theory?

Axiomatic set theory. Chapter Why axiomatic set theory? Chapter 1 Axiomatic set theory 1.1 Why axiomatic set theory? Essentially all mathematical theories deal with sets in one way or another. In most cases, however, the use of set theory is limited to its

More information

KLEENE LOGIC AND INFERENCE

KLEENE LOGIC AND INFERENCE Bulletin of the Section of Logic Volume 4:1/2 (2014), pp. 4 2 Grzegorz Malinowski KLEENE LOGIC AND INFERENCE Abstract In the paper a distinguished three-valued construction by Kleene [2] is analyzed. The

More information

Advanced Topics in LP and FP

Advanced Topics in LP and FP Lecture 1: Prolog and Summary of this lecture 1 Introduction to Prolog 2 3 Truth value evaluation 4 Prolog Logic programming language Introduction to Prolog Introduced in the 1970s Program = collection

More information

CIS260 Mathematical Foundations of Computer Science Some Notes

CIS260 Mathematical Foundations of Computer Science Some Notes CIS260 Mathematical Foundations of Computer Science Some Notes Jean Gallier Department of Computer and Information Science University of Pennsylvania Philadelphia, PA 19104, USA e-mail: jean@cis.upenn.edu

More information

Lecture Notes on Classical Modal Logic

Lecture Notes on Classical Modal Logic Lecture Notes on Classical Modal Logic 15-816: Modal Logic André Platzer Lecture 5 January 26, 2010 1 Introduction to This Lecture The goal of this lecture is to develop a starting point for classical

More information

TR : Tableaux for the Logic of Proofs

TR : Tableaux for the Logic of Proofs City University of New York (CUNY) CUNY Academic Works Computer Science Technical Reports Graduate Center 2004 TR-2004001: Tableaux for the Logic of Proofs Bryan Renne Follow this and additional works

More information

A Little Deductive Logic

A Little Deductive Logic A Little Deductive Logic In propositional or sentential deductive logic, we begin by specifying that we will use capital letters (like A, B, C, D, and so on) to stand in for sentences, and we assume that

More information

1 Completeness Theorem for Classical Predicate

1 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 information

Part I: Propositional Calculus

Part I: Propositional Calculus Logic Part I: Propositional Calculus Statements Undefined Terms True, T, #t, 1 False, F, #f, 0 Statement, Proposition Statement/Proposition -- Informal Definition Statement = anything that can meaningfully

More information

1. A motivation for algebraic approaches to logics

1. A motivation for algebraic approaches to logics Andrzej W. Jankowski AN ALGEBRAIC APPROACH TO LOGICS IN RESEARCH WORK OF HELENA RASIOWA AND CECYLIA RAUSZER 1. A motivation for algebraic approaches to logics To realize the importance of the research

More information

2. The Logic of Compound Statements Summary. Aaron Tan August 2017

2. The Logic of Compound Statements Summary. Aaron Tan August 2017 2. The Logic of Compound Statements Summary Aaron Tan 21 25 August 2017 1 2. The Logic of Compound Statements 2.1 Logical Form and Logical Equivalence Statements; Compound Statements; Statement Form (Propositional

More information

cis32-ai lecture # 18 mon-3-apr-2006

cis32-ai lecture # 18 mon-3-apr-2006 cis32-ai lecture # 18 mon-3-apr-2006 today s topics: propositional logic cis32-spring2006-sklar-lec18 1 Introduction Weak (search-based) problem-solving does not scale to real problems. To succeed, problem

More information

Description Logics. Foundations of Propositional Logic. franconi. Enrico Franconi

Description Logics. Foundations of Propositional Logic.   franconi. Enrico Franconi (1/27) Description Logics Foundations of Propositional Logic Enrico Franconi franconi@cs.man.ac.uk http://www.cs.man.ac.uk/ franconi Department of Computer Science, University of Manchester (2/27) Knowledge

More information

Kazimierz SWIRYDOWICZ UPPER PART OF THE LATTICE OF EXTENSIONS OF THE POSITIVE RELEVANT LOGIC R +

Kazimierz 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 information

Propositional natural deduction

Propositional natural deduction Propositional natural deduction COMP2600 / COMP6260 Dirk Pattinson Australian National University Semester 2, 2016 Major proof techniques 1 / 25 Three major styles of proof in logic and mathematics Model

More information

Filtrations and Basic Proof Theory Notes for Lecture 5

Filtrations and Basic Proof Theory Notes for Lecture 5 Filtrations and Basic Proof Theory Notes for Lecture 5 Eric Pacuit March 13, 2012 1 Filtration Let M = W, R, V be a Kripke model. Suppose that Σ is a set of formulas closed under subformulas. We write

More information

Propositional Logic. Jason Filippou UMCP. ason Filippou UMCP) Propositional Logic / 38

Propositional Logic. Jason Filippou UMCP. ason Filippou UMCP) Propositional Logic / 38 Propositional Logic Jason Filippou CMSC250 @ UMCP 05-31-2016 ason Filippou (CMSC250 @ UMCP) Propositional Logic 05-31-2016 1 / 38 Outline 1 Syntax 2 Semantics Truth Tables Simplifying expressions 3 Inference

More information

The Curry-Howard Isomorphism

The Curry-Howard Isomorphism The Curry-Howard Isomorphism Software Formal Verification Maria João Frade Departmento de Informática Universidade do Minho 2008/2009 Maria João Frade (DI-UM) The Curry-Howard Isomorphism MFES 2008/09

More information

CHAPTER 10. Predicate Automated Proof Systems

CHAPTER 10. Predicate Automated Proof Systems CHAPTER 10 ch10 Predicate Automated Proof Systems We define and discuss here a Rasiowa and Sikorski Gentzen style proof system QRS for classical predicate logic. The propositional version of it, the RS

More information

First-Order Intuitionistic Logic with Decidable Propositional Atoms

First-Order Intuitionistic Logic with Decidable Propositional Atoms First-Order Intuitionistic Logic with Decidable Propositional Atoms Alexander Sakharov alex@sakharov.net http://alex.sakharov.net Abstract First-order intuitionistic logic extended with the assumption

More information