# Propositional Logics and their Algebraic Equivalents

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Propositional Logics and their Algebraic Equivalents Kyle Brooks April 18, 2012 Contents 1 Introduction 1 2 Formal Logic Systems Consequence Relations Propositional Logic Systems The axiomatic approach to proof The Algebraic Structure of Logic Systems Boolean Algebra Heyting Algebras Closing Remarks 9 1 Introduction This paper is meant as an introduction to the study of logic for undergraduate mathematicians having completed a year-long course in abstract algebra. It is possible to investigate a logic as an algebraic structure, the properties of that structure giving insight in to the logic itself. We will discuss that connection between Boolean algebras and the system of classical propositional logic. We will also introduce the idea of different logical systems, and investigate their algebraic equivalents as well. 1

2 2 Formal Logic Systems Before we can discuss the algebraic representations of formal logics, we must first define the semantics and syntax of a formal logic system. Definition 2.1. A formal logic system S is comprised of the following objects: 1. A language L, which is generated by: (a) A finite set of symbols; sequences of these symbols are called words. (b) A set of formulas, which are special cases of words. (c) A set of rules for creating formulas called the syntax of L. 2. A deductive system H, which consists of: (a) A set of formulas called the axioms of H. (b) A set of rules called the rules of inference on S. These rules along with the axioms are used to generate new formulas, which are called the theorems of S. Definition 2.2. A propositional language L is a language whose symbols (besides parentheses) belong to one of two sets: the set of atomic formulas or the set of connectives. The atomic formulas are the variables and constants in the language of L. A connective is a symbol that acts as an unary or binary function on other formulas. In algebraic parlance, a connective is an operator on the formulas of L. The formulas of L are defined inductively as follows: 1. Every variable is a formula, and every constant is a formula. 2. If is an unary connective, then for any formula φ, φ is also a formula. 3. If is a binary connective, then for any formulas φ, ψ, φ ψ is also a formula. We will include parentheses in our language to denote order of operations. Parentheses are added to formulas according to the rule: if φ is a formula, then (φ) is a formula. Note. One could also view the constants of a propositional language as 0-ary connectives (i.e., connectives with no arguments). Definition 2.3. A propositional logic system is a logic system over a propositional language. 2

3 2.1 Consequence Relations If S is a formal logic system with a deductive system H and X is an arbitrary set of formulas, then we say that a formula φ is deducible from X if there is a finite sequence of formulas {φ 1, φ 2,..., φ n } such that φ = φ n and for every φ i in the sequence, φ i either belongs to X, is an axiom of H, or is obtained from the formulas {φ 1,..., φ i 1 } via one of the inference rules of H. Such a sequence is called a proof of φ with hypotheses X [3]. A consequence relation is a relation between sets of formulas and formulas defined X φ if φ is deducible from X by the rules and axioms of its corresponding deductive system. Then has the following properties: 1. if φ X then X φ 2. if X φ and X Y then Y φ 3. if X φ and for every ψ X, Y ψ, then Y φ For consequence relations where the set on the left contains a single formula, we will simply write φ ψ. Definition 2.4. The relation over the set of formulas F of L is defined φ ψ if and only if (i) φ ψ and (ii) ψ φ. Then is an equivalence relation on F ; it is the same as the statement φ if and only if ψ. For our purposes, we will write the equivalence class of the formula φ as [φ]. Definition 2.5. Any formula φ such that φ is a tautology; it is always true regardless of premises. The axioms of a deductive system are all tautologies. Theorem 2.1. The relation is a partial order on the equivalence classes of formulas. Proof. satisfies the three properties of a partial ordering: 1. Reflexivity: φ [φ], therefore φ φ. 2. Transitivity: From φ ψ, we know that there is a list of formulas proving ψ from φ and the axioms of H, and from ψ χ we know that there is another list of formulas proving χ from ψ. Concatenating these lists together (with some caveats: see [1]) produces a proof of χ from φ. So φ χ. 3. Anti-symmetry: if φ ψ and ψ φ then [φ] = [ψ]. 3

4 3 Propositional Logic Systems The language of Classical Propositional Logic (CPL) contains the variables {p, q,... } (denoting individual propositions), the constants {, } (denoting true and false), the unary connective { } (denoting negation), and the binary connectives {,, } (denoting conjunction, disjunction, and implication). 3.1 The axiomatic approach to proof However, it is also possible to provide a set of axioms, definitions, and rules of inference which describe H. There are many possible axiomatizations for CPL; we will use a comparatively large set of eleven axioms in our formulation of CPL [1], which are given in table 1. Table 1: 11 Axioms for CPL Name Axiom schema (φ, ψ, χ formulas) THEN-1 φ (χ φ) THEN-2 (φ (χ ψ)) ((φ χ) (φ ψ)) AND-1 φ χ φ AND-2 φ χ χ AND-3 φ (χ (φ χ)) OR-1 φ φ χ OR-2 χ φ χ OR-3 (φ ψ) ((χ ψ) (φ χ ψ)) NOT-1 (φ χ) ((φ χ) φ) NOT-2 φ ( φ χ) NOT-3 φ φ We define the contradiction to be φ φ and the tautology as. The only rule of inference of CPL is Modus Ponens, which states: {φ, φ ψ} ψ That is, if we know that φ and φ ψ are true, we may infer ψ is true. Theorem 3.1 (Deduction Theorem). If {φ 1,..., φ n, φ} ψ, then we can infer that {φ 1,..., φ n } φ ψ (For proof, see [1, ch. 1]). Corollary 3.2. If φ ψ, then φ ψ. Definition 3.1. Intuitionistic Propositional Logic (IPL) is a logical system which is identical to CPL in every way except that it lacks the axiom NOT-3, φ φ, also known as the law of the excluded middle. 4

5 4 The Algebraic Structure of Logic Systems Here is an example of a basic proof in CPL: Lemma 4.1. {φ, ψ} φ ψ. Proof. (1) φ hypothesis (2) ψ hypothesis (3) φ (ψ (φ ψ)) AND-3 (4) ψ (φ ψ) Modus Ponens on 1, 3 (5) φ ψ Modus Ponens on 2, 4 Theorem 4.2. The equivalence classes of formulas(given by ) of both CPL and IPL form a lattice λ under and. Proof. The least upper bound of the formulas φ and ψ is φ ψ. That is, the following statements φ (φ ψ) and ψ (φ ψ) are true, and for any formula χ for which φ χ and ψ χ, (φ ψ) χ. First, we show that (φ ψ) is an upper bound: φ (φ ψ): (1) φ hypothesis (2) φ (φ ψ) OR-1 (3) φ ψ Modus Ponens on (1), (2) ψ (φ ψ): (1) ψ hypothesis (2) ψ (φ ψ) OR-2 (3) (φ ψ) Modus Ponens on (1), (2) Now, we show that (φ ψ) is a least upper bound. That is, if φ χ and ψ χ, then (φ ψ) χ. This is equivalent (by Theorem 3.1) to the statement {φ χ, ψ χ, φ ψ} χ. 5

6 {φ χ, ψ χ, φ ψ} χ: (1) φ χ hypothesis (2) ψ χ hypothesis (3) φ ψ hypothesis (4) (φ χ) ((ψ χ) (φ ψ χ)) OR-3 (5) (ψ χ) (φ ψ χ) Modus Ponens on (1), (4) (6) φ ψ χ Modus Ponens on (2), (5) (7) χ Modus Ponens on (3), (6) Similarly, the greatest lower bound of the formulas φ and ψ is φ ψ: (φ ψ) φ: (1) φ ψ hypothesis (2) (φ ψ) φ AND-1 (3) φ Modus Ponens on (1), (2) (φ ψ) ψ: (1) φ ψ hypothesis (2) (φ ψ) ψ AND-2 (3) ψ Modus Ponens on (1), (2) {χ φ, χ ψ, χ} φ ψ: (1) χ hypothesis (2) χ φ hypothesis (3) χ ψ hypothesis (4) φ Modus Ponens on (1), (2) (5) ψ Modus Ponens on (1), (3) (6) φ ψ Lemma 4.1 on (4), (5) 6

7 The largest element of λ is the class of tautologies, [ ]. The smallest is the class of contradictions, [ ]. From the basic properties of lattices, we know that the commutative, associative, idempotent, and absorption laws hold for the logical connectives and (See Theorem 19.2 in [4]). The following theorem will allow us to further characterize the algebraic structure of these logic systems. Theorem 4.3. In CPL and IPL, conjunction distributes over disjunction and vice-versa. This is called the Rule of distribution, and it is stated formally as follows: φ (ψ χ) (φ ψ) (φ χ) φ (ψ χ) (φ ψ) (φ χ) Proof. We will prove the forward direction for conjunction distributing over disjunction. We will prove two separate statements: (i) φ (φ ψ) (φ χ) (1) φ hypothesis (2) φ (φ ψ) OR-1 (3) φ (φ χ) OR-2 (4) φ ψ Modus Ponens on 1, 2 (5) φ χ Modus Ponens on 1, 3 (6) (φ ψ) (φ χ) Lemma 4.1 on 4, 5 (ii) (ψ χ) (φ ψ) (φ χ) (1) ψ χ hypothesis (2) (ψ χ) ψ AND-1 (3) (ψ χ) χ AND-2 (4) ψ Modus Ponens on 1, 2 (5) χ Modus Ponens on 1, 3 (6) ψ (φ ψ) OR-2 (7) χ (φ χ) OR-2 (8) φ ψ Modus Ponens on 4, 6 (9) φ χ Modus Ponens on 5, 7 (10) (φ ψ) (φ χ) Lemma 4.1 on 8, 9 7

8 Theorem 4.2 tells us that because (φ (ψ χ)) is the least upper bound of φ and (ψ χ), and (φ ψ) (φ χ) is also an upper bound, then φ (ψ χ) (φ ψ) (φ χ). For the proof of the converse, see Podnieks and Detlovs [1, ch. 2]. By the principle of duality [4, p. 302], we may infer that disjunction distributes over conjunction. 4.1 Boolean Algebra We have shown that conjunction and disjunction on CPL and IPL follow the laws of commutativity, associativity, idempotence, absorption, and distribution. At this point, we have not shown that there is any difference between the algebraic models of each logic. The next step we take will expose a difference, as it will depend on the axiom NOT-3, which belongs only to CPL. The final step in characterizing the algebra of CPL as a Boolean algebra is to show that the the equivalence classes of its formulas are complemented. Theorem 4.4. The set of equivalence classes of formulas in CPL is a Boolean algebra over the operations of conjunction and disjunction. Proof. It only remains to show that CPL is complemented to establish this fact. For any formula φ in CPL, its complement is φ. We must show that φ φ and φ φ. The former is trivial, as its hypothesis is the axiom NOT-3 which is tautological by definition. Similarly, the statement φ φ is the definition of a contradiction, both in CPL and in IPL. The connection of CPL to Boolean algebras is the reason we can use truth tables to evaluate formulas. Because propositions and formulas have only two truth-values in CPL and there are a finite number of terms in every formula, we can build a table of all the possible truth values of the terms in a formula to ascertain the validity of the formula itself. In the truth-table approach, the consequence relation is defined as follows: for a set of formulas F and a formula φ, F φ if and only if every assignment of truth values that assigns to all ψ F also assigns to φ [3]. From the truth table, it is easy to see that {p, q} (p q), because every truth valuation that assigns to p and q also assigns to (p q). We can also see that the connective is equivalent to the conjunction and disjunction operators by p q ( p q). 4.2 Heyting Algebras The system of intuitionistic propositional logic is not complemented because it lacks the axiom NOT-3. Furthermore, the implication connective cannot be 8

9 Table 2: Truth table for propositions and connectives in CPL p q p p q p q p q defined in terms of conjunction and disjunction, as is possible in CPL. The complete algebraization of IPL, then, must somehow make use of this connective as an operator. The complete algebraization of IPL gives us what is known as a Heyting Algebra [5], which is a distributed lattice with an additional operator with the following additional axioms that govern the behavior of the new operator: 1. a a = 2. a (a b) = a b 3. b (a b) = b 4. a (b c) = (a b) (a c) If we define the implication operation so that a b = a b, then the Heyting algebra becomes a Boolean algebra. In this way, Boolean algebras are a subset of Heyting algebras; equivalently, we could say that CPL s are a subset of IPL s. 5 Closing Remarks The goal of this paper was not to give a complete description of the relationship between logic systems and algebras but to give a hint at the deep connection between the two fields. The complete description of the correspondence between a class of algebras and their logical counterparts was given by Tarski in 1935 [2], who expanded on Lindenbaum s idea of viewing the equivalence classes of formulas as a set with operations given by the connectives in the language. The complete, generalized version of Tarski s method is known as an algebraization of a logic system. Today, the investigation of the process of algebraization itself, and inquiry into the classes of logics can be successfully algebraized, has given rise to the field of Abstract Algebraic Logic. 9

10 References [1] V. Detlovs and K. Podnieks. Introduction to Mathematical Logic. University of Latvia, [2] Josep Maria Font, Ramon Jansana, and Don Pigozzi. A survey of abstract algebraic logic. Studia Logica, 329, [3] Ramon Jansana. Propositional consequence relations and algebraic logic. The Stanford Encyclopedia of Philosophy, Spring, [4] Thomas W. Judson. Abstract Algebra: Theory and Applications edition, [5] R. Padmanabhan and S. Rudeanu. Axioms for Lattices and Boolean Algebras. World Scientific Publishing Company, Copyleft Kyle Brooks (2012) cb 10

### 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

### 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

### 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

### 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

### 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

### 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

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

### 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

### 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

### Review 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

### Compound Propositions

Discrete Structures Compound Propositions Producing new propositions from existing propositions. Logical Operators or Connectives 1. Not 2. And 3. Or 4. Exclusive or 5. Implication 6. Biconditional Truth

### 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

### Logic, Sets, and Proofs

Logic, Sets, and Proofs David A. Cox and Catherine C. McGeoch Amherst College 1 Logic Logical Operators. A logical statement is a mathematical statement that can be assigned a value either true or false.

### 2.2: Logical Equivalence: The Laws of Logic

Example (2.7) For primitive statement p and q, construct a truth table for each of the following compound statements. a) p q b) p q Here we see that the corresponding truth tables for two statement p q

### Boolean 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

### Boolean 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

### Logic 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.

### CSC Discrete Math I, Spring Propositional Logic

CSC 125 - Discrete Math I, Spring 2017 Propositional Logic Propositions A proposition is a declarative sentence that is either true or false Propositional Variables A propositional variable (p, q, r, s,...)

### Propositional Logic. Spring Propositional Logic Spring / 32

Propositional Logic Spring 2016 Propositional Logic Spring 2016 1 / 32 Introduction Learning Outcomes for this Presentation Learning Outcomes... At the conclusion of this session, we will Define the elements

### 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)

### MAI0203 Lecture 7: Inference and Predicate Calculus

MAI0203 Lecture 7: Inference and Predicate Calculus Methods of Artificial Intelligence WS 2002/2003 Part II: Inference and Knowledge Representation II.7 Inference and Predicate Calculus MAI0203 Lecture

### 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

### 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.)

### Logic. Definition [1] A logic is a formal language that comes with rules for deducing the truth of one proposition from the truth of another.

Math 0413 Appendix A.0 Logic Definition [1] A logic is a formal language that comes with rules for deducing the truth of one proposition from the truth of another. This type of logic is called propositional.

### COMP 182 Algorithmic Thinking. Proofs. Luay Nakhleh Computer Science Rice University

COMP 182 Algorithmic Thinking Proofs Luay Nakhleh Computer Science Rice University 1 Reading Material Chapter 1, Section 3, 6, 7, 8 Propositional Equivalences The compound propositions p and q are called

### 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

### 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

### 1. 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:

### Natural Deduction is a method for deriving the conclusion of valid arguments expressed in the symbolism of propositional logic.

Natural Deduction is a method for deriving the conclusion of valid arguments expressed in the symbolism of propositional logic. The method consists of using sets of Rules of Inference (valid argument forms)

### Logic for Computer Science - Week 5 Natural Deduction

Logic for Computer Science - Week 5 Natural Deduction Ștefan Ciobâcă November 30, 2017 1 An Alternative View of Implication and Double Implication So far, we have understood as a shorthand of However,

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

### 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

### Lecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook)

Lecture 2 Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits Reading (Epp s textbook) 2.1-2.4 1 Logic Logic is a system based on statements. A statement (or

### Propositional Logic: Part II - Syntax & Proofs 0-0

Propositional Logic: Part II - Syntax & Proofs 0-0 Outline Syntax of Propositional Formulas Motivating Proofs Syntactic Entailment and Proofs Proof Rules for Natural Deduction Axioms, theories and theorems

### 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

### 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

### Truth-Functional Logic

Truth-Functional Logic Syntax Every atomic sentence (A, B, C, ) is a sentence and are sentences With ϕ a sentence, the negation ϕ is a sentence With ϕ and ψ sentences, the conjunction ϕ ψ is a sentence

### 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,

### COMP219: Artificial Intelligence. Lecture 19: Logic for KR

COMP219: Artificial Intelligence Lecture 19: Logic for KR 1 Overview Last time Expert Systems and Ontologies Today Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof

### The Logic of Compound Statements cont.

The Logic of Compound Statements cont. CSE 215, Computer Science 1, Fall 2011 Stony Brook University http://www.cs.stonybrook.edu/~cse215 Refresh from last time: Logical Equivalences Commutativity of :

### Equational Logic: Part 2. Roland Backhouse March 6, 2001

1 Equational Logic: Part 2 Roland Backhouse March 6, 2001 Outline 2 We continue the axiomatisation of the propositional connectives. The axioms for disjunction (the logical or of two statements) are added

### 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

### 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

### 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

### Learning Goals of CS245 Logic and Computation

Learning Goals of CS245 Logic and Computation Alice Gao April 27, 2018 Contents 1 Propositional Logic 2 2 Predicate Logic 4 3 Program Verification 6 4 Undecidability 7 1 1 Propositional Logic Introduction

### Discrete Structures of Computer Science Propositional Logic III Rules of Inference

Discrete Structures of Computer Science Propositional Logic III Rules of Inference Gazihan Alankuş (Based on original slides by Brahim Hnich) July 30, 2012 1 Previous Lecture 2 Summary of Laws of Logic

### Intelligent Agents. First Order Logic. Ute Schmid. Cognitive Systems, Applied Computer Science, Bamberg University. last change: 19.

Intelligent Agents First Order Logic Ute Schmid Cognitive Systems, Applied Computer Science, Bamberg University last change: 19. Mai 2015 U. Schmid (CogSys) Intelligent Agents last change: 19. Mai 2015

### 1 IPL and Heyting Prelattices

CHAPTER 11: FULL PROPOSITIONAL LOGICS 1 IPL and Heyting Prelattices By full PLs, we mean ones with the complete inventory of standard connectives: those of PIPL (,, T), as well as, F, and. In this section

### Logic and Proofs. (A brief summary)

Logic and Proofs (A brief summary) Why Study Logic: To learn to prove claims/statements rigorously To be able to judge better the soundness and consistency of (others ) arguments To gain the foundations

### 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)

### 1.3 Propositional Equivalences

1 1.3 Propositional Equivalences The replacement of a statement with another statement with the same truth is an important step often used in Mathematical arguments. Due to this methods that produce propositions

### Equivalence and Implication

Equivalence and Alice E. Fischer CSCI 1166 Discrete Mathematics for Computing February 7 8, 2018 Alice E. Fischer Laws of Logic... 1/33 1 Logical Equivalence Contradictions and Tautologies 2 3 4 Necessary

### Packet #1: Logic & Proofs. Applied Discrete Mathematics

Packet #1: Logic & Proofs Applied Discrete Mathematics Table of Contents Course Objectives Page 2 Propositional Calculus Information Pages 3-13 Course Objectives At the conclusion of this course, you should

### Logic and Discrete Mathematics. Section 3.5 Propositional logical equivalence Negation of propositional formulae

Logic and Discrete Mathematics Section 3.5 Propositional logical equivalence Negation of propositional formulae Slides version: January 2015 Logical equivalence of propositional formulae Propositional

### 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

### COMP219: Artificial Intelligence. Lecture 19: Logic for KR

COMP219: Artificial Intelligence Lecture 19: Logic for KR 1 Overview Last time Expert Systems and Ontologies Today Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof

### Chapter 4, Logic using Propositional Calculus Handout

ECS 20 Chapter 4, Logic using Propositional Calculus Handout 0. Introduction to Discrete Mathematics. 0.1. Discrete = Individually separate and distinct as opposed to continuous and capable of infinitesimal

### 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

### Inquisitive Logic. Ivano Ciardelli.

Inquisitive Logic Ivano Ciardelli www.illc.uva.nl/inquisitive-semantics Information states A state is a set of valuations. Support Let s be a state. The system InqB 1. s = p iff w s : w(p) = 1 2. s = iff

### Logic Overview, I. and T T T T F F F T F F F F

Logic Overview, I DEFINITIONS A statement (proposition) is a declarative sentence that can be assigned a truth value T or F, but not both. Statements are denoted by letters p, q, r, s,... The 5 basic logical

### PHIL 50 - Introduction to Logic

Truth Validity Logical Consequence Equivalence V ψ ψ φ 1, φ 2,, φ k ψ φ ψ PHIL 50 - Introduction to Logic Marcello Di Bello, Stanford University, Spring 2014 Week 2 Friday Class Overview of Key Notions

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

### Overview. I Review of natural deduction. I Soundness and completeness. I Semantics of propositional formulas. I Soundness proof. I Completeness proof.

Overview I Review of natural deduction. I Soundness and completeness. I Semantics of propositional formulas. I Soundness proof. I Completeness proof. Propositional formulas Grammar: ::= p j (:) j ( ^ )

### The semantics of propositional logic

The semantics of propositional logic Readings: Sections 1.3 and 1.4 of Huth and Ryan. In this module, we will nail down the formal definition of a logical formula, and describe the semantics of propositional

### 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

### Section 1.2: Propositional Logic

Section 1.2: Propositional Logic January 17, 2017 Abstract Now we re going to use the tools of formal logic to reach logical conclusions ( prove theorems ) based on wffs formed by some given statements.

### The Modal Logic of Pure Provability

The Modal Logic of Pure Provability Samuel R. Buss Department of Mathematics University of California, San Diego July 11, 2002 Abstract We introduce a propositional modal logic PP of pure provability in

### Some consequences of compactness in Lukasiewicz Predicate Logic

Some consequences of compactness in Lukasiewicz Predicate Logic Luca Spada Department of Mathematics and Computer Science University of Salerno www.logica.dmi.unisa.it/lucaspada 7 th Panhellenic Logic

### 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

### Logic Synthesis and Verification

Logic Synthesis and Verification Boolean Algebra Jie-Hong Roland Jiang 江介宏 Department of Electrical Engineering National Taiwan University Fall 2014 1 2 Boolean Algebra Reading F. M. Brown. Boolean Reasoning:

### 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

### CSE 20: Discrete Mathematics

Spring 2018 Summary Last time: Today: Logical connectives: not, and, or, implies Using Turth Tables to define logical connectives Logical equivalences, tautologies Some applications Proofs in propositional

### MATH 770 : Foundations of Mathematics. Fall Itay Ben-Yaacov

MATH 770 : Foundations of Mathematics Fall 2005 Itay Ben-Yaacov Itay Ben-Yaacov, University of Wisconsin Madison, Department of Mathematics, 480 Lincoln Drive, Madison, WI 53706-1388, USA URL: http://www.math.wisc.edu/~pezz

### First-Order Logic. 1 Syntax. Domain of Discourse. FO Vocabulary. Terms

First-Order Logic 1 Syntax Domain of Discourse The domain of discourse for first order logic is FO structures or models. A FO structure contains Relations Functions Constants (functions of arity 0) FO

### INF3170 Logikk Spring Homework #8 For Friday, March 18

INF3170 Logikk Spring 2011 Homework #8 For Friday, March 18 Problems 2 6 have to do with a more explicit proof of the restricted version of the completeness theorem: if = ϕ, then ϕ. Note that, other than

### 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,

### Announcements. CS243: Discrete Structures. Propositional Logic II. Review. Operator Precedence. Operator Precedence, cont. Operator Precedence Example

Announcements CS243: Discrete Structures Propositional Logic II Işıl Dillig First homework assignment out today! Due in one week, i.e., before lecture next Tuesday 09/11 Weilin s Tuesday office hours are

### 1. 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:

### Propositional Logic. Fall () Propositional Logic Fall / 30

Propositional Logic Fall 2013 () Propositional Logic Fall 2013 1 / 30 1 Introduction Learning Outcomes for this Presentation 2 Definitions Statements Logical connectives Interpretations, contexts,... Logically

### First Order Logic (FOL) 1 znj/dm2017

First Order Logic (FOL) 1 http://lcs.ios.ac.cn/ znj/dm2017 Naijun Zhan March 19, 2017 1 Special thanks to Profs Hanpin Wang (PKU) and Lijun Zhang (ISCAS) for their courtesy of the slides on this course.

### 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

### An Independence Relation for Sets of Secrets

Sara Miner More Pavel Naumov An Independence Relation for Sets of Secrets Abstract. A relation between two secrets, known in the literature as nondeducibility, was originally introduced by Sutherland.

### 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

### 1 The Foundation: Logic and Proofs

1 The Foundation: Logic and Proofs 1.1 Propositional Logic Propositions( 명제 ) a declarative sentence that is either true or false, but not both nor neither letters denoting propositions p, q, r, s, T:

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

### 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

### 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

### Equivalents of Mingle and Positive Paradox

Eric Schechter Equivalents of Mingle and Positive Paradox Abstract. Relevant logic is a proper subset of classical logic. It does not include among itstheoremsanyof positive paradox A (B A) mingle A (A

### CSCI.6962/4962 Software Verification Fundamental Proof Methods in Computer Science (Arkoudas and Musser) Chapter p. 1/33

CSCI.6962/4962 Software Verification Fundamental Proof Methods in Computer Science (Arkoudas and Musser) Chapter 4.1-4.8 p. 1/33 CSCI.6962/4962 Software Verification Fundamental Proof Methods in Computer

### Unit 1. Propositional Logic Reading do all quick-checks Propositional Logic: Ch. 2.intro, 2.2, 2.3, 2.4. Review 2.9

Unit 1. Propositional Logic Reading do all quick-checks Propositional Logic: Ch. 2.intro, 2.2, 2.3, 2.4. Review 2.9 Typeset September 23, 2005 1 Statements or propositions Defn: A statement is an assertion

### It rains now. (true) The followings are not propositions.

Chapter 8 Fuzzy Logic Formal language is a language in which the syntax is precisely given and thus is different from informal language like English and French. The study of the formal languages is the

### Knowledge base (KB) = set of sentences in a formal language Declarative approach to building an agent (or other system):

Logic Knowledge-based agents Inference engine Knowledge base Domain-independent algorithms Domain-specific content Knowledge base (KB) = set of sentences in a formal language Declarative approach to building

### The 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

### Propositional Logic. CS 3234: Logic and Formal Systems. Martin Henz and Aquinas Hobor. August 26, Generated on Tuesday 31 August, 2010, 16:54

Propositional Logic CS 3234: Logic and Formal Systems Martin Henz and Aquinas Hobor August 26, 2010 Generated on Tuesday 31 August, 2010, 16:54 1 Motivation In traditional logic, terms represent sets,

### CHAPTER 1. MATHEMATICAL LOGIC 1.1 Fundamentals of Mathematical Logic

CHAPER 1 MAHEMAICAL LOGIC 1.1 undamentals of Mathematical Logic Logic is commonly known as the science of reasoning. Some of the reasons to study logic are the following: At the hardware level the design

### 1 The Foundation: Logic and Proofs

1 The Foundation: Logic and Proofs 1.1 Propositional Logic Propositions( ) a declarative sentence that is either true or false, but not both nor neither letters denoting propostions p, q, r, s, T: true

### 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