Discrete Mathematics

Size: px
Start display at page:

Download "Discrete Mathematics"

Transcription

1 1 Discrete Mathematics SSDUT, DUT Zhikui Chen, PhD, Professor Office: Office Building 405,Tel: Lab: Student Lab in Office Building (Big Data Institute) Mobile: QQ:

2 Discrete Mathematics Chapter 1:Propositional Logic

3 2/36 Review Propositional variable Compound formula Tautology Contradiction Tautological implication Substitution rule Replacement rule Basic equivalent formulas (30) Basic tautological implication (16)

4 1.5 Duality principle Definition: P( QR ) P( QR ) P F P T 3/36

5 4/36 Duality principle PQ ( PQ) PQ ( PQ)

6 5/36 Duality principle A B APPBPP (,,,) 12 n (,,,) n APPBPP (,,,) (,,,) 12 n 12 n APPPBPPP (,,,)(,,,) 12 n 12 n ipi ( 1,2,) n A APPBPP (,,,) (,,,) 12 n 12 B n

7 6/36 Duality principle Example: If 若 ( )( ( ) PQPPQ PQ, 试证明 ( PQPPQ )( ( ) PQ Prove:Assume A ( PQ ) ( P( PQ) B PQ try to prove so * A PQ P PQ ( ) ( ( )) * B PQ Because, A B Therefore, * * A B

8 7/36 Duality principle Try to prove: (1)( P Q) ( ) Prove: 证明 :( P Q) ( P Q) 16 PQ T (2)( P Q) ( PQ) F ( P Q) ( P Q) E (( P Q) ( P Q)) ( P Q) E (( P Q) ( P Q)) ( P Q) E, E (( P Q) ( P Q)) (( P Q) ( P Q)) E ( P Q P Q) ( P Q P Q) ( P T ) ( Q T ) E, E T T T E, E E 8

9 8/36 Duality principle Try to prove:(1)( P Q) ( ) Prove: 证明 :( P Q) ( P Q) PQ T (2)( P Q) ( PQ) F (( P Q) ( P Q )) ( P Q) E For 由 ( P Q) ( P Q) (( P Q ) ( P Q)) ( P Q) E, E So 知 ( P Q) ( P Q) 和, ( P Q) ( P Q) 互为对偶式 are reciprocal 由于 T的对偶式是 duality. For F, T is 因此由定理 dual to F, based 知 on theorem 1.5-1, ( P Q) ( P Q) F

10 9/36 Duality principle Theorem 1.5-3: If A B, and A, B are made up of variables P P P B A * * 1, 2,, n and connectives,,,. Prove: A B means is tautological. Based on reverse law, B( P1, P2,, Pn) A( P1, P2,, Pn) is tautological. According to Theorem is tautological. Using the substitution rule, is substituted by P( i 1,2, n), we can get Namely, A( P, P,, P ) B( P, P,, P ) 1 2 n 1 2 B ( P, P,, P ) A ( P, P,, P ) i 1 2 n 1 2 B ( P, P,, P ) A ( P, P,, P ) 1 2 n 1 2 B A n P i n is tautological. n

11 10/ Normal form and judgment Standard form of the formula Normal form Used in the finite steps to determine the formula of permanent true, permanent false, satiable.

12 Disjunctive and Conjunctive normal form Definition: If a propositional formula is the product of some propositional variables and their negations, it's called the basic product;if it is the sum of some variables and their negations, it is called basic sum. Basic product: 基本积 : PQPQPQPQPPQPQ,,,,,,, Basic 基本和 sum: : PPQQPQPQPP,,,,,, A formula composed of the sum of the basic product. If it is equivalent to the given formula A, it is called the disjunctive normal form of A. Disjunctive normal 析取范式 form : : PQPQPQPQPQ,,,,,()() A formula composed of the product of the basic sum. If it is equivalent to the given formula A, it is called the conjunctive normal form of A. 合取范式 :,,,, PQPQPQP,()() 11/36 Conjunctive normal form :

13 Disjunctive and Conjunctive normal form 12/36 Theorem 1.6-1: A basic product is permanent false if and only if it contains two factors likes P, P Prove: (Sufficiency)For P Pis permanent false and QF F, so the basic product that contains and is false. (Necessity) Proof by contradiction: Let the basic product be false but not contains the form of factor P and P, assigning the true value T to the propositional variables in this basic product, and assigning the truth value F to propositional variables with negations, thus the true value of the basic product is T, which contradicts to the hypothesis. P P

14 Disjunctive and Conjunctive normal form 13/36 Theorem1.6-2: A basic sum is permanent true if and only if it contains two factors likes P, P.

15 14/36 Disjunctive and Conjunctive normal form Example:Give the disjunctive normal form of P (Q R) Solution: P (Q R) P ( Q R) ( P Q) ( P R)

16 Disjunctive and Conjunctive normal form 15/36 Example:Give the conjunctive normal form of ( P Q) (P Q) Solution:( P Q) (P Q) (( P Q) (P Q)) ( ( P Q) (P Q)) (( P Q) ( P Q)) ((P Q) (P Q)) ( P Q) (P Q) /*Disjunctive normal formal*/ (( P Q) P) (( P Q) Q) (P Q) ( P Q)

17 Disjunctive and Conjunctive normal form Example:Give the disjunctive normal form of Solution: ( P Q) ( P Q) ( P Q) ( P Q) ( ( P Q)) ( P Q) ( P Q P Q) (( P Q) ( P Q)) F ( P Q) ( P Q) ( P Q) ( P Q) (( P Q) P) (( P Q) Q) P P P Q P Q Q Q F P Q P Q F ( P Q) ( P Q) 16/36

18 17/36 Disjunctive and Conjunctive normal form Example:Give the conjunctive normal form of 解 : 令 A ( P Q) ( P Q), so 那么 Solution: Let A ( ( P Q) ( P Q)) ( ( P Q) ( P Q)) ( ( ( P Q) ( P Q))) (( P Q P Q) (( P Q) ( P Q))) P Q P Q 由于 For A A ( P Q P Q) 所以 A ( P Q) ( P Q) Thus

19 18/36 Principal disjunctive normal form Definition 1.6-4: In the basic product with n variables, if each variable does not coexist with its negation, and one of the two must occur only once, this basic product is called minimum term. Example: The minimum terms for two propositional variables P and Q are: PQPQPQPQ,,, For n propositional variables, the number of minimum terms is 2 n

20 19/36 Principal disjunctive normal form For three variables P, Q, R P Q R P Q R P Q R P Q R P Q R P Q R P Q R P Q R m m m m m m m m

21 20/36 Principal disjunctive normal form Each minimum term has only one truth value assignment to make it T The conjunction of any two minimum terms is false The disjunction for all minimum terms is true

22 21/36 Principal disjunctive normal form Definition 1.6-5:A formula consisting of the sum of the minimum terms, If it is equivalent to a propositional formula A, it is called the principal disjunctive normal form of formula A. The equivalent principal disjunctive normal form can be obtained for any propositional formula (except the permanent false formula), and the form of the principal disjunctive normal form is unique.

23 Principal disjunctive normal form The method to find the principal disjunction normal form: First, it is transformed into its equivalent disjunctive normal form; If the same propositional variable appears more than once in the basic product of the disjunctive normal form, it will be reduced to once only; Remove all basic products that are permanent false in the disjunctive normal form; If a propositional variable is missing from the disjunctive normal form, for example P, ( PPQQ ) is used to add it to the formula. Then the distribution law is employed to expand it and the same basic products are merged. 22/36

24 23/36 Principal disjunctive normal form A P Q R ( P Q ) ( R R ) ( P P ) R ( P Q R ) ( P Q R ) ( P R ) ( P R ) ( P Q R ) ( P Q R ) P R ( Q Q ) ( P R ) ( Q Q ) ( P Q R ) ( P Q R ) ( P Q R ) ( P Q R ) ( P Q R ) ( P Q R ) ( P Q R ) ( P Q R ) ( P Q R ) ( P Q R ) ( P Q R ) m 7 m 6 m 5 m 3 m 1 (1, 3, 5, 6, 7 )

25 24/36 Principal disjunctive normal form The relation between Principal disjunctive normal form and truth table The right diagram is the truth table of APQR : Minimum P Q R P Q R terms P Q R P QR PQ R P QR P Q R P QR P Q R P Q R

26 25/36 Principal conjunctive normal form Definition 1.6-6: In the basic sum with n variables, if each variable does not coexist with its negation, and one of the two must occur only once, this basic sum is called maximum term. Example: For two propositional variables P and Q, the maximum terms are: PQPQPQPQ,,, For n variables, the number of maximum terms is 2 n

27 26/36 Principal conjunctive normal form For three variables P, Q, R, P Q R P Q R P Q R P Q R P Q R P Q R P Q R P Q R M M M M M M M M

28 27/36 Principal conjunctive normal form Each maximum term has only one truth value assignment to make it F The disjunction of any two maximum terms is true The conjunction for all maximum terms is false

29 28/36 Principal conjunctive normal form Definition 1.6-7:A formula consisting of the product of the maximum terms, if it is equivalent to a propositional formula A, it is called the principal conjunctive normal form of formula A. The equivalent principal conjunctive normal form can be obtained for any propositional formula (except the permanent true formula), and the form of the principal conjunctive normal form is unique.

30 29/36 Principal conjunctive normal form A P Q R ( P R) ( Q R) (( P R) ( Q Q)) (( Q R) ( P P)) ( P Q R) ( P Q R) ( P Q R) ( P Q R) ( P Q R) ( P Q R) ( P Q R) M M M (0, 2, 4)

31 30/36 Principal conjunctive normal form The relation between principal conjunctive normal form and truth table The right diagram is the truth table of : APQR Considering the minimum terms? Maximum terms P Q R P Q R P Q R P Q R P QR P Q R P QR PQ R P QR P Q R1

32 31/36 Relation between maximum and minimum terms The relations between minimum term and maximum term M i m i M m i i i m M i

33 32/36 From conjunction (disjunction) to principal disjunction (conjunction) They can be transformed into each other For formula A, its principal conjunction is: ( PQRPQR )( ) Give the principal disjunction. Answer: A s principal conjunction is M 1 ΛM 3, so A s principal disjunction is ( 0,2,4,5,6,7 ) Thus, the principal disjunction of A is ( PQR )( PQRPQR )( ) ( PQRPQRPQR )( )( )

34 33/36 Principal disjunction and conjunction For a propositional formula, which is permanent true, all the minimum terms of its propositional variables appear in its principal disjunction, and there is no equivalent principal conjunction; For a propositional formula, which is permanent false, all the maximum terms of its propositional variables appear in its principal conjunction, and there is no equivalent principal disjunction; For a propositional formula, which is permanent satiable, it has the equivalent principal disjunction and the equivalent principal conjunction.

35 34/36 Principal disjunction and conjunction Example: Find the main normal form of the following formula: (P Q) R Answer:(P Q) R ( P Q ) R (P Q) R (P R) (Q R) (P R (Q Q)) (Q R (P P)) (P Q R) (P Q R)) (P Q R) ( P Q R ) M 1,3,5 /* represents for conjunction*/ m 0,2,4,6,7 /*This formula is satiable*/

36 35/36 Principal disjunction and conjunction Example: Find the main normal form of the following formula: (P Q R) ( P Q S) Answer: (P Q R) ( P Q S) (P Q R S) (P Q R S) ( P Q R S) ( P Q R S) m 11, 10, 6, 4 /* represents for disjunction*/ M 0,1,2,3,5,7,8,9,10,12,13,14,15 The principal disjunction and conjunction can be obtained at the same time

37 36/36 Homework P (1)(3) 18(2)(4)

2.2: Logical Equivalence: The Laws of Logic

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

More information

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

More information

CSC Discrete Math I, Spring Propositional Logic

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

More information

Solutions to Homework I (1.1)

Solutions to Homework I (1.1) Solutions to Homework I (1.1) Problem 1 Determine whether each of these compound propositions is satisable. a) (p q) ( p q) ( p q) b) (p q) (p q) ( p q) ( p q) c) (p q) ( p q) (a) p q p q p q p q p q (p

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

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

Compound Propositions

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

More information

Type and Propositions

Type and Propositions Fall 2018 Type and Propositions Yu Zhang Course web site: http://staff.ustc.edu.cn/~yuzhang/tpl Yu Zhang: Types and Propositions 1 Outline Curry-Howard Isomorphism - Constructive Logic - Classical Logic

More information

Packet #1: Logic & Proofs. Applied Discrete Mathematics

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

More information

Part Two: The Basic Components of the SOFL Specification Language

Part Two: The Basic Components of the SOFL Specification Language Part Two: The Basic Components of the SOFL Specification Language SOFL logic Module Condition Data Flow Diagrams Process specification Function definition and specification Process decomposition Other

More information

Proofs. Joe Patten August 10, 2018

Proofs. Joe Patten August 10, 2018 Proofs Joe Patten August 10, 2018 1 Statements and Open Sentences 1.1 Statements A statement is a declarative sentence or assertion that is either true or false. They are often labelled with a capital

More information

A statement is a sentence that is definitely either true or false but not both.

A statement is a sentence that is definitely either true or false but not both. 5 Logic In this part of the course we consider logic. Logic is used in many places in computer science including digital circuit design, relational databases, automata theory and computability, and artificial

More information

1.1 Language and Logic

1.1 Language and Logic c Oksana Shatalov, Fall 2017 1 1.1 Language and Logic Mathematical Statements DEFINITION 1. A proposition is any declarative sentence (i.e. it has both a subject and a verb) that is either true or false,

More information

Section 1.2 Propositional Equivalences. A tautology is a proposition which is always true. A contradiction is a proposition which is always false.

Section 1.2 Propositional Equivalences. A tautology is a proposition which is always true. A contradiction is a proposition which is always false. Section 1.2 Propositional Equivalences A tautology is a proposition which is always true. Classic Example: P P A contradiction is a proposition which is always false. Classic Example: P P A contingency

More information

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

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

More information

d) There is a Web page that includes links to both Web page A and Web page B.

d) There is a Web page that includes links to both Web page A and Web page B. P403-406 5. Determine whether the relation R on the set of all eb pages is reflexive( 自反 ), symmetric( 对 称 ), antisymmetric( 反对称 ), and/or transitive( 传递 ), where (a, b) R if and only if a) Everyone who

More information

1.1 Language and Logic

1.1 Language and Logic c Oksana Shatalov, Spring 2018 1 1.1 Language and Logic Mathematical Statements DEFINITION 1. A proposition is any declarative sentence (i.e. it has both a subject and a verb) that is either true or false,

More information

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

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

More information

AMTH140 Lecture 8. Symbolic Logic

AMTH140 Lecture 8. Symbolic Logic AMTH140 Lecture 8 Slide 1 Symbolic Logic March 10, 2006 Reading: Lecture Notes 6.2, 6.3; Epp 1.1, 1.2 Logical Connectives Let p and q denote propositions, then: 1. p q is conjunction of p and q, meaning

More information

Announcements. CS311H: Discrete Mathematics. Propositional Logic II. Inverse of an Implication. Converse of a Implication

Announcements. CS311H: Discrete Mathematics. Propositional Logic II. Inverse of an Implication. Converse of a Implication Announcements CS311H: Discrete Mathematics Propositional Logic II Instructor: Işıl Dillig First homework assignment out today! Due in one week, i.e., before lecture next Wed 09/13 Remember: Due before

More information

CSE 20: Discrete Mathematics

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

More information

Section L.1- Introduction to Logic

Section L.1- Introduction to Logic Section L.1- Introduction to Logic Definition: A statement, or proposition, is a declarative sentence that can be classified as either true or false, but not both. Example 1: Which of the following are

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 / 26 Why Study Logic?

More information

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. 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 ( ^ )

More information

Tautologies, Contradictions, and Contingencies

Tautologies, Contradictions, and Contingencies Section 1.3 Tautologies, Contradictions, and Contingencies A tautology is a proposition which is always true. Example: p p A contradiction is a proposition which is always false. Example: p p A contingency

More information

Microbiology. Zhao Liping 赵立平 Chen Feng. School of Life Science and Technology, Shanghai Jiao Tong University

Microbiology. Zhao Liping 赵立平 Chen Feng. School of Life Science and Technology, Shanghai Jiao Tong University 1896 1920 1987 2006 Microbiology By Zhao Liping 赵立平 Chen Feng 陈峰 School of Life Science and Technology, Shanghai Jiao Tong University http://micro.sjtu.edu.cn 1896 1920 1987 2006 Preface : Introduction

More information

~ p is always false. Based on the basic truth table for disjunction, if q is true then p ~

~ p is always false. Based on the basic truth table for disjunction, if q is true then p ~ MAT 101 Solutions Exam 2 (Logic, Part I) Multiple-Choice Questions 1. D Because this sentence contains exactly ten words, it is stating that it is false. But if it is taken to be false, then it has to

More information

1.3 Propositional Equivalences

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

More information

Solutions to Sample Problems for Midterm

Solutions to Sample Problems for Midterm Solutions to Sample Problems for Midterm Problem 1. The dual of a proposition is defined for which contains only,,. It is For a compound proposition that only uses,, as operators, we obtained the dual

More information

What is Logic? Introduction to Logic. Simple Statements. Which one is statement?

What is Logic? Introduction to Logic. Simple Statements. Which one is statement? What is Logic? Introduction to Logic Peter Lo Logic is the study of reasoning It is specifically concerned with whether reasoning is correct Logic is also known as Propositional Calculus CS218 Peter Lo

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

Definition 2. Conjunction of p and q

Definition 2. Conjunction of p and q Proposition Propositional Logic CPSC 2070 Discrete Structures Rosen (6 th Ed.) 1.1, 1.2 A proposition is a statement that is either true or false, but not both. Clemson will defeat Georgia in football

More information

Example. Logic. Logical Statements. Outline of logic topics. Logical Connectives. Logical Connectives

Example. Logic. Logical Statements. Outline of logic topics. Logical Connectives. Logical Connectives Logic Logic is study of abstract reasoning, specifically, concerned with whether reasoning is correct. Logic focuses on relationship among statements as opposed to the content of any particular statement.

More information

Propositional Logic. Yimei Xiang 11 February format strictly follow the laws and never skip any step.

Propositional Logic. Yimei Xiang 11 February format strictly follow the laws and never skip any step. Propositional Logic Yimei Xiang yxiang@fas.harvard.edu 11 February 2014 1 Review Recursive definition Set up the basis Generate new members with rules Exclude the rest Subsets vs. proper subsets Sets of

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

We last time we began introducing equivalency laws.

We last time we began introducing equivalency laws. Monday, January 14 MAD2104 Discrete Math 1 Course website: www/mathfsuedu/~wooland/mad2104 Today we will continue in Course Notes Chapter 22 We last time we began introducing equivalency laws Today we

More information

The Logic of Compound Statements cont.

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 :

More information

PROPOSITIONAL CALCULUS

PROPOSITIONAL CALCULUS PROPOSITIONAL CALCULUS A proposition is a complete declarative sentence that is either TRUE (truth value T or 1) or FALSE (truth value F or 0), but not both. These are not propositions! Connectives and

More information

Mathematical Reasoning (Part I) 1

Mathematical Reasoning (Part I) 1 c Oksana Shatalov, Spring 2017 1 Mathematical Reasoning (art I) 1 Statements DEFINITION 1. A statement is any declarative sentence 2 that is either true or false, but not both. A statement cannot be neither

More information

Introduction Logic Inference. Discrete Mathematics Andrei Bulatov

Introduction Logic Inference. Discrete Mathematics Andrei Bulatov Introduction Logic Inference Discrete Mathematics Andrei Bulatov Discrete Mathematics - Logic Inference 6-2 Previous Lecture Laws of logic Expressions for implication, biconditional, exclusive or Valid

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

LING 106. Knowledge of Meaning Lecture 3-1 Yimei Xiang Feb 6, Propositional logic

LING 106. Knowledge of Meaning Lecture 3-1 Yimei Xiang Feb 6, Propositional logic LING 106. Knowledge of Meaning Lecture 3-1 Yimei Xiang Feb 6, 2016 Propositional logic 1 Vocabulary of propositional logic Vocabulary (1) a. Propositional letters: p, q, r, s, t, p 1, q 1,..., p 2, q 2,...

More information

Learning Goals of CS245 Logic and Computation

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

More information

Propositional Equivalence

Propositional Equivalence Propositional Equivalence Tautologies and contradictions A compound proposition that is always true, regardless of the truth values of the individual propositions involved, is called a tautology. Example:

More information

Section 1.1: Logical Form and Logical Equivalence

Section 1.1: Logical Form and Logical Equivalence Section 1.1: Logical Form and Logical Equivalence An argument is a sequence of statements aimed at demonstrating the truth of an assertion. The assertion at the end of an argument is called the conclusion,

More information

2/13/2012. Logic: Truth Tables. CS160 Rosen Chapter 1. Logic?

2/13/2012. Logic: Truth Tables. CS160 Rosen Chapter 1. Logic? Logic: Truth Tables CS160 Rosen Chapter 1 Logic? 1 What is logic? Logic is a truth-preserving system of inference Truth-preserving: If the initial statements are true, the inferred statements will be true

More information

Section 1.2: Propositional Logic

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.

More information

Steinhardt School of Culture, Education, and Human Development Department of Teaching and Learning. Mathematical Proof and Proving (MPP)

Steinhardt School of Culture, Education, and Human Development Department of Teaching and Learning. Mathematical Proof and Proving (MPP) Steinhardt School of Culture, Education, and Human Development Department of Teaching and Learning Terminology, Notations, Definitions, & Principles: Mathematical Proof and Proving (MPP) 1. A statement

More information

A Statement; Logical Operations

A Statement; Logical Operations A Statement; Logical Operations Mathematical logic is a branch of mathematics that deals with the formal principles, methods and criteria of validity of reasoning and knowledge. Logic is concerned with

More information

Propositional Calculus

Propositional Calculus CHAPTER - 1 Propositional Calculus Introduction Logic means reasoning. One of the important aims of logic is to provide rules through which one can determine the validity of any particular argument. Logic

More information

Unit I LOGIC AND PROOFS. B. Thilaka Applied Mathematics

Unit I LOGIC AND PROOFS. B. Thilaka Applied Mathematics Unit I LOGIC AND PROOFS B. Thilaka Applied Mathematics UNIT I LOGIC AND PROOFS Propositional Logic Propositional equivalences Predicates and Quantifiers Nested Quantifiers Rules of inference Introduction

More information

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

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

More information

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.

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.

More information

Logic. Def. A Proposition is a statement that is either true or false.

Logic. Def. A Proposition is a statement that is either true or false. Logic Logic 1 Def. A Proposition is a statement that is either true or false. Examples: Which of the following are propositions? Statement Proposition (yes or no) If yes, then determine if it is true or

More information

PHI Propositional Logic Lecture 2. Truth Tables

PHI Propositional Logic Lecture 2. Truth Tables PHI 103 - Propositional Logic Lecture 2 ruth ables ruth ables Part 1 - ruth unctions for Logical Operators ruth unction - the truth-value of any compound proposition determined solely by the truth-value

More information

Chapter 1, Logic and Proofs (3) 1.6. Rules of Inference

Chapter 1, Logic and Proofs (3) 1.6. Rules of Inference CSI 2350, Discrete Structures Chapter 1, Logic and Proofs (3) Young-Rae Cho Associate Professor Department of Computer Science Baylor University 1.6. Rules of Inference Basic Terminology Axiom: a statement

More information

Introduction to Sets and Logic (MATH 1190)

Introduction to Sets and Logic (MATH 1190) Introduction to Sets Logic () Instructor: Email: shenlili@yorku.ca Department of Mathematics Statistics York University Sept 18, 2014 Outline 1 2 Tautologies Definition A tautology is a compound proposition

More information

HW1 graded review form? HW2 released CSE 20 DISCRETE MATH. Fall

HW1 graded review form? HW2 released CSE 20 DISCRETE MATH. Fall CSE 20 HW1 graded review form? HW2 released DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Translate sentences from English to propositional logic using appropriate

More information

Lecture 02: Propositional Logic

Lecture 02: Propositional Logic Lecture 02: Propositional Logic CSCI 358 Discrete Mathematics, Spring 2016 Hua Wang, Ph.D. Department of Electrical Engineering and Computer Science January 19, 2015 Propositional logic Propositional logic

More information

CSE 20 DISCRETE MATH WINTER

CSE 20 DISCRETE MATH WINTER CSE 20 DISCRETE MATH WINTER 2016 http://cseweb.ucsd.edu/classes/wi16/cse20-ab/ Reminders Exam 1 in one week One note sheet ok Review sessions Saturday / Sunday Assigned seats: seat map on Piazza shortly

More information

https://vu5.sfc.keio.ac.jp/slide/

https://vu5.sfc.keio.ac.jp/slide/ 1 FUNDAMENTALS OF LOGIC NO.2 PROPOSITION AND TRUTH VALUE Tatsuya Hagino hagino@sfc.keio.ac.jp lecture URL https://vu5.sfc.keio.ac.jp/slide/ Proposition A Proposition is a statement of which truth does

More information

Department of Computer Science & Software Engineering Comp232 Mathematics for Computer Science

Department of Computer Science & Software Engineering Comp232 Mathematics for Computer Science Department of Computer Science & Software Engineering Comp232 Mathematics for Computer Science Fall 2018 Assignment 1. Solutions 1. For each of the following statements use a truth table to determine whether

More information

CISC-102 Winter 2016 Lecture 17

CISC-102 Winter 2016 Lecture 17 CISC-102 Winter 2016 Lecture 17 Logic and Propositional Calculus Propositional logic was eventually refined using symbolic logic. The 17th/18th century philosopher Gottfried Leibniz (an inventor of calculus)

More information

= lim(x + 1) lim x 1 x 1 (x 2 + 1) 2 (for the latter let y = x2 + 1) lim

= lim(x + 1) lim x 1 x 1 (x 2 + 1) 2 (for the latter let y = x2 + 1) lim 1061 微乙 01-05 班期中考解答和評分標準 1. (10%) (x + 1)( (a) 求 x+1 9). x 1 x 1 tan (π(x )) (b) 求. x (x ) x (a) (5 points) Method without L Hospital rule: (x + 1)( x+1 9) = (x + 1) x+1 x 1 x 1 x 1 x 1 (x + 1) (for the

More information

Propositional Logic Basics Propositional Equivalences Normal forms Boolean functions and digital circuits. Propositional Logic.

Propositional Logic Basics Propositional Equivalences Normal forms Boolean functions and digital circuits. Propositional Logic. Propositional Logic Winter 2012 Propositional Logic: Section 1.1 Proposition A proposition is a declarative sentence that is either true or false. Which ones of the following sentences are propositions?

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

Chapter 1: Formal Logic

Chapter 1: Formal Logic Chapter 1: Formal Logic Dr. Fang (Daisy) Tang ftang@cpp.edu www.cpp.edu/~ftang/ CS 130 Discrete Structures Logic: The Foundation of Reasoning Definition: the foundation for the organized, careful method

More information

n logical not (negation) n logical or (disjunction) n logical and (conjunction) n logical exclusive or n logical implication (conditional)

n logical not (negation) n logical or (disjunction) n logical and (conjunction) n logical exclusive or n logical implication (conditional) Discrete Math Review Discrete Math Review (Rosen, Chapter 1.1 1.6) TOPICS Propositional Logic Logical Operators Truth Tables Implication Logical Equivalence Inference Rules What you should know about propositional

More information

0 0 = 1 0 = 0 1 = = 1 1 = 0 0 = 1

0 0 = 1 0 = 0 1 = = 1 1 = 0 0 = 1 0 0 = 1 0 = 0 1 = 0 1 1 = 1 1 = 0 0 = 1 : = {0, 1} : 3 (,, ) = + (,, ) = + + (, ) = + (,,, ) = ( + )( + ) + ( + )( + ) + = + = = + + = + = ( + ) + = + ( + ) () = () ( + ) = + + = ( + )( + ) + = = + 0

More information

Functions. Lecture 4: Truth functions, evaluating compound statements. Arithmetic Functions. x y x+y

Functions. Lecture 4: Truth functions, evaluating compound statements. Arithmetic Functions. x y x+y Lecture 4: ruth functions, evaluating compound statements 1. unctions, arithmetic functions, and truth functions 2. Definitions of truth functions unctions A function is something that takes inputs and

More information

Section 1.1: Propositions and Connectives

Section 1.1: Propositions and Connectives Section 1.1: Propositions and Connectives Definition : Proposition: A statement that has exactly one truth value, i.e., either true (T) or false (F). Axiom (or Postulate): A statement about the primitive

More information

1.1 Statements and Compound Statements

1.1 Statements and Compound Statements Chapter 1 Propositional Logic 1.1 Statements and Compound Statements A statement or proposition is an assertion which is either true or false, though you may not know which. That is, a statement is something

More information

Tecniche di Verifica. Introduction to Propositional Logic

Tecniche di Verifica. Introduction to Propositional Logic Tecniche di Verifica Introduction to Propositional Logic 1 Logic A formal logic is defined by its syntax and semantics. Syntax An alphabet is a set of symbols. A finite sequence of these symbols is called

More information

VALIDITY IN SENTENTIAL LOGIC

VALIDITY IN SENTENTIAL LOGIC ITY IN SENTENTIAL LOGIC 1. Tautologies, Contradictions, and Contingent Formulas...62 2. Implication And Equivalence...64 3. Validity in Sentential Logic...66 4. Testing Arguments in Sentential Logic...67

More information

Supplementary exercises in propositional logic

Supplementary exercises in propositional logic Supplementary exercises in propositional logic The purpose of these exercises is to train your ability to manipulate and analyze logical formulas. Familiarize yourself with chapter 7.3-7.5 in the course

More information

KP/Worksheets: Propositional Logic, Boolean Algebra and Computer Hardware Page 1 of 8

KP/Worksheets: Propositional Logic, Boolean Algebra and Computer Hardware Page 1 of 8 KP/Worksheets: Propositional Logic, Boolean Algebra and Computer Hardware Page 1 of 8 Q1. What is a Proposition? Q2. What are Simple and Compound Propositions? Q3. What is a Connective? Q4. What are Sentential

More information

Discrete Mathematics & Mathematical Reasoning Predicates, Quantifiers and Proof Techniques

Discrete Mathematics & Mathematical Reasoning Predicates, Quantifiers and Proof Techniques Discrete Mathematics & Mathematical Reasoning Predicates, Quantifiers and Proof Techniques Colin Stirling Informatics Some slides based on ones by Myrto Arapinis Colin Stirling (Informatics) Discrete Mathematics

More information

Readings: Conjecture. Theorem. Rosen Section 1.5

Readings: Conjecture. Theorem. Rosen Section 1.5 Readings: Conjecture Theorem Lemma Lemma Step 1 Step 2 Step 3 : Step n-1 Step n a rule of inference an axiom a rule of inference Rosen Section 1.5 Provide justification of the steps used to show that a

More information

Comp487/587 - Boolean Formulas

Comp487/587 - Boolean Formulas Comp487/587 - Boolean Formulas 1 Logic and SAT 1.1 What is a Boolean Formula Logic is a way through which we can analyze and reason about simple or complicated events. In particular, we are interested

More information

Propositional Logic. Fall () Propositional Logic Fall / 30

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

More information

Discrete Structures & Algorithms. Propositional Logic EECE 320 // UBC

Discrete Structures & Algorithms. Propositional Logic EECE 320 // UBC Discrete Structures & Algorithms Propositional Logic EECE 320 // UBC 1 Review of last lecture Pancake sorting A problem with many applications Bracketing (bounding a function) Proving bounds for pancake

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

CSE 240 Logic and Discrete Mathematics

CSE 240 Logic and Discrete Mathematics CSE 240 Logic and Discrete Mathematics Instructor: odd Sproull Department of Computer Science and Engineering Washington University in St. Louis 1Extensible - CSE 240 Logic Networking and Discrete Platform

More information

Propositional Calculus: Formula Simplification, Essential Laws, Normal Forms

Propositional Calculus: Formula Simplification, Essential Laws, Normal Forms P Formula Simplification, Essential Laws, Normal Forms Lila Kari University of Waterloo P Formula Simplification, Essential Laws, Normal CS245, Forms Logic and Computation 1 / 26 Propositional calculus

More information

COMP219: Artificial Intelligence. Lecture 19: Logic for KR

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

More information

Syntax of propositional logic. Syntax tree of a formula. Semantics of propositional logic (I) Subformulas

Syntax of propositional logic. Syntax tree of a formula. Semantics of propositional logic (I) Subformulas Syntax of propositional logic Syntax tree of a formula An atomic formula has the form A i where i =, 2, 3,.... Formulas are defined by the following inductive process: Every formula can be represented

More information

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

More information

Boolean Algebra and Proof. Notes. Proving Propositions. Propositional Equivalences. Notes. Notes. Notes. Notes. March 5, 2012

Boolean Algebra and Proof. Notes. Proving Propositions. Propositional Equivalences. Notes. Notes. Notes. Notes. March 5, 2012 March 5, 2012 Webwork Homework. The handout on Logic is Chapter 4 from Mary Attenborough s book Mathematics for Electrical Engineering and Computing. Proving Propositions We combine basic propositions

More information

Truth-Functional Logic

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

More information

CSE 20 DISCRETE MATH. Fall

CSE 20 DISCRETE MATH. Fall CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Describe and use algorithms for integer operations based on their expansions Relate algorithms for integer

More information

Introduction Propositional Logic

Introduction Propositional Logic Discrete Mathematics for CSE of KU Introduction Propositional Logic Instructor: Kangil Kim (CSE) E-mail: kikim01@konkuk.ac.kr Tel. : 02-450-3493 Room : New Milenium Bldg. 1103 Lab : New Engineering Bldg.

More information

Boolean Logic. CS 231 Dianna Xu

Boolean Logic. CS 231 Dianna Xu Boolean Logic CS 231 Dianna Xu 1 Proposition/Statement A proposition is either true or false but not both The sky is blue Lisa is a Math major x == y Not propositions: Are you Bob? x := 7 2 Boolean variables

More information

Logic and Propositional Calculus

Logic and Propositional Calculus CHAPTER 4 Logic and Propositional Calculus 4.1 INTRODUCTION Many algorithms and proofs use logical expressions such as: IF p THEN q or If p 1 AND p 2, THEN q 1 OR q 2 Therefore it is necessary to know

More information

10/5/2012. Logic? What is logic? Propositional Logic. Propositional Logic (Rosen, Chapter ) Logic is a truth-preserving system of inference

10/5/2012. Logic? What is logic? Propositional Logic. Propositional Logic (Rosen, Chapter ) Logic is a truth-preserving system of inference Logic? Propositional Logic (Rosen, Chapter 1.1 1.3) TOPICS Propositional Logic Truth Tables Implication Logical Proofs 10/1/12 CS160 Fall Semester 2012 2 What is logic? Logic is a truth-preserving system

More information

Introduction to Decision Sciences Lecture 2

Introduction to Decision Sciences Lecture 2 Introduction to Decision Sciences Lecture 2 Andrew Nobel August 24, 2017 Compound Proposition A compound proposition is a combination of propositions using the basic operations. For example (p q) ( p)

More information

Discrete Mathematics and Its Applications

Discrete Mathematics and Its Applications Discrete Mathematics and Its Applications Lecture 1: Proposition logic MING GAO DASE @ ECNU (for course related communications) mgao@dase.ecnu.edu.cn Sep. 12, 2017 Outline 1 Propositions 2 Connectives

More information

CSCI Homework Set 1 Due: September 11, 2018 at the beginning of class

CSCI Homework Set 1 Due: September 11, 2018 at the beginning of class CSCI 3310 - Homework Set 1 Due: September 11, 2018 at the beginning of class ANSWERS Please write your name and student ID number clearly at the top of your homework. If you have multiple pages, please

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

Tools for reasoning: Logic. Ch. 1: Introduction to Propositional Logic Truth values, truth tables Boolean logic: Implications:

Tools for reasoning: Logic. Ch. 1: Introduction to Propositional Logic Truth values, truth tables Boolean logic: Implications: Tools for reasoning: Logic Ch. 1: Introduction to Propositional Logic Truth values, truth tables Boolean logic: Implications: 1 Why study propositional logic? A formal mathematical language for precise

More information

VALIDITY IN SENTENTIAL LOGIC

VALIDITY IN SENTENTIAL LOGIC ITY IN SENTENTIAL LOGIC 1. Tautologies, Contradictions, And Contingent Formulas...66 2. Implication And Equivalence...68 3. Validity In Sentential Logic...70 4. Testing Arguments In Sentential Logic...71

More information