Chapter 1: The Foundations: Logic and Proofs

Slides:



Advertisements
Similar presentations
1. Propositions A proposition is a declarative sentence that is either true or false. Examples of propositions: The Moon is made of green cheese. Trenton.
Advertisements

2.2 Conditional Statements. Goals Identify statements which are conditional Identify the antecedent and consequent of a conditional statement Negate conditional.
Logic Chapter 2. Proposition "Proposition" can be defined as a declarative statement having a specific truth-value, true or false. Examples: 2 is a odd.
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
Propositional Logic. Negation Given a proposition p, negation of p is the ‘not’ of p.
1 Section 1.1 Logic. 2 Proposition Statement that is either true or false –can’t be both –in English, must contain a form of “to be” Examples: –Cate Sheller.
Discrete Mathematics Math 6A Instructor: M. Welling.
CSE115/ENGR160 Discrete Mathematics 01/17/12 Ming-Hsuan Yang UC Merced 1.
First Order Logic. Propositional Logic A proposition is a declarative sentence (a sentence that declares a fact) that is either true or false, but not.
Adapted from Discrete Math
Chapter 1, Part I: Propositional Logic With Question/Answer Animations.
The Foundations: Logic and Proofs
Discrete Mathematics Goals of a Discrete Mathematics Learn how to think mathematically 1. Mathematical Reasoning Foundation for discussions of methods.
Propositions and Truth Tables
The Foundations: Logic and Proofs
2009/9 1 Logic and Proofs §1.1 Introduction §1.2 Propositional Equivalences §1.3 Predicates and Quantifiers §1.4 Nested Quantifiers §1.5~7 Methods of Proofs.
Discrete Maths 2. Propositional Logic Objective
MATH 213 A – Discrete Mathematics for Computer Science Dr. (Mr.) Bancroft.
Discrete Mathematics and Its Applications
2009/9 1 Logic and Proofs §1.1 Introduction §1.2 Propositional Equivalences §1.3 Predicates and Quantifiers §1.4 Nested Quantifiers §1.5~7 Methods of.
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Sixth Edition, Mc Graw-Hill, 2007 Ch.1 (Part 1): The Foundations: Logic and Proofs Introduction.
Mathematical Structures A collection of objects with operations defined on them and the accompanying properties form a mathematical structure or system.
Propositional Logic Foundations of Logic: Overview Propositional logic (§ ): – Basic definitions. (§1.1) – Equivalence rules & derivations. (§1.2)
Chapter 1, Part I: Propositional Logic With Question/Answer Animations.
Chapter 2: The Logic of Compound Statements 2.2 Conditional Statements
Lecture 4. CONDITIONAL STATEMENTS: Consider the statement: "If you earn an A in Math, then I'll buy you a computer." This statement is made up of two.
Lecture Propositional Equivalences. Compound Propositions Compound propositions are made by combining existing propositions using logical operators.
1 CMSC 250 Discrete Structures CMSC 250 Lecture 1.
CS 381 DISCRETE STRUCTURES Gongjun Yan Aug 25, November 2015Introduction & Propositional Logic 1.
LOGIC Lesson 2.1. What is an on-the-spot Quiz  This quiz is defined by me.  While I’m having my lectures, you have to be alert.  Because there are.
Propositional Logic ITCS 2175 (Rosen Section 1.1, 1.2)
Chapter 2 Logic 2.1 Statements 2.2 The Negation of a Statement 2.3 The Disjunction and Conjunction of Statements 2.4 The Implication 2.5 More on Implications.
Chapter 1: The Foundations: Logic and Proofs
Chapter 1: The Foundations: Logic and Proofs
Section 1.1. Section Summary Propositions Connectives Negation Conjunction Disjunction Implication; contrapositive, inverse, converse Biconditional Truth.
Mathematics for Comter I Lecture 2: Logic (1) Basic definitions Logical operators Translating English sentences.
LECTURE 1. Disrete mathematics and its application by rosen 7 th edition THE FOUNDATIONS: LOGIC AND PROOFS 1.1 PROPOSITIONAL LOGIC.
رياضيات متقطعة لعلوم الحاسب MATH 226. Text books: (Discrete Mathematics and its applications) Kenneth H. Rosen, seventh Edition, 2012, McGraw- Hill.
Section 1.1. Propositions A proposition is a declarative sentence that is either true or false. Examples of propositions: a) The Moon is made of green.
CS104 The Foundations: Logic and Proof 1. 2 What is Discrete Structure?  Discrete Objects  Separated from each other (Opposite of continuous)  e.g.,
Chapter 1. Chapter Summary  Propositional Logic  The Language of Propositions (1.1)  Logical Equivalences (1.3)  Predicate Logic  The Language of.
Simple Logic.
Discrete Structures for Computer Science Presented By: Andrew F. Conn Slides adapted from: Adam J. Lee Lecture #1: Introduction, Propositional Logic August.
2. The Logic of Compound Statements Summary
CSNB 143 Discrete Mathematical Structures
Niu Kun Discrete Mathematics Chapter 1 The Foundations: Logic and Proof, Sets, and Functions Niu Kun 离散数学.
6/20/2018 Arab Open University Faculty of Computer Studies M131 - Discrete Mathematics 6/20/2018.
Logic.
Ch.1 (Part 1): The Foundations: Logic and Proofs
The Foundations: Logic and Proofs
The Foundations: Logic and Proofs
The Foundations: Logic and Proofs
Principles of Computing – UFCFA3-30-1
Information Technology Department
Applications of Propositional Logic
Chapter 1 The Foundations: Logic and Proof, Sets, and Functions
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
(1.4) An Introduction to Logic
1 Chapter An Introduction to Problem Solving
Discrete Mathematics and Its Applications Kenneth H
Discrete Mathematics Lecture 2: Propositional Logic
1 Chapter An Introduction to Problem Solving
MAT 3100 Introduction to Proof
Cs Discrete Mathematics
The Foundations: Logic and Proofs
1.3 Propositional Equivalences
Discrete Structures Prepositional Logic 2
The Foundations: Logic and Proofs
The Foundations: Logic and Proofs
Presentation transcript:

Chapter 1: The Foundations: Logic and Proofs 1.1 Propositional Logic 1.2 Propositional Equivalences 1.3 Predicates and Quantifiers 1.4 Nested Quantifiers 1.5 Rules of Inference 1.6 Introduction to Proofs 1.7 Proof Methods and Strategy

1.1: Propositional Logic Propositions: A proposition is a declarative sentence (that is, a sentence that declares a fact) that is either true or false, but not both.

Example 1: All the following declarative sentences are propositions: Washington D.C., is the capital of the USA. 2. Toronto is the capital of Canada 3. 1+1=2. 4. 2+2=3.

Example 2: Consider the following sentences. Are they propositions? 1. What time is it? 2. Read this carefully. 3. x+1=2. 4. x+y=z

We use letters to denote propositional variables (or statement variables). T: the value of a proposition is true. F: the value of a proposition is false. The area of logic that deals with propositions is called the propositional calculus or propositional logic.

Let p and q are propositions: Definition 1: Negation (Not) Symbol: ¬ Statement: “it is not the case that p”. Example: P: I am going to town ¬P: It is not the case that I am going to town; I am not going to town; I ain’t goin’.

p:\msoffice\My Projects\Rosen 6e 2007\Imagebank\JPEGs07-24-06\ch01\jpeg\t01_1_001.jpg

Definition 2: Conjunction (And) Symbol: The conjunction pq is true when both p and q are true and is false otherwise. Example: P - ‘I am going to town’ Q - ‘It is going to rain’ PQ: ‘I am going to town and it is going to rain.’

t01_1_002.jpg p:\msoffice\My Projects\Rosen 6e 2007\Imagebank\JPEGs07-24-06\ch01\jpeg\t01_1_002.jpg

Definition 3: Disjunction (Or) Symbol: The disjunction pq is false when both p and q are false and is true otherwise. Example: P - ‘I am going to town’ Q - ‘It is going to rain’ P  Q: ‘I am going to town or it is going to rain.’

p:\msoffice\My Projects\Rosen 6e 2007\Imagebank\JPEGs07-24-06\ch01\jpeg\t01_1_003.jpg

Definition 4: Exclusive OR Symbol: The exclusive or of p and q, denote pq, is true when exactly one of p and q is true and is false otherwise. Example: P - ‘I am going to town’ Q - ‘It is going to rain’ P  Q: ‘Either I am going to town or it is going to rain.’ 

p:\msoffice\My Projects\Rosen 6e 2007\Imagebank\JPEGs07-24-06\ch01\jpeg\t01_1_004.jpg

Definition 5: Implication If…. Then…. Symbol: The conditional statement pq is false when p is true and q is false, and true P is called the hypothesis and q is called the conclusion. Example: P - ‘I am going to town’ Q - ‘It is going to rain’ P Q: ‘If I am going to town then it is going to rain.’

p:\msoffice\My Projects\Rosen 6e 2007\Imagebank\JPEGs07-24-06\ch01\jpeg\t01_1_005.jpg

Equivalent Forms If P, then Q P implies Q If P, Q P only if Q P is a sufficient condition for Q Q if P Q whenever P Q is a necessary condition for P

Note: The implication is false only when P is true and Q is false! ‘If the moon is made of green cheese then I have more money than Bill Gates’ (?) ‘If the moon is made of green cheese then I’m on welfare’ (?) ‘If 1+1=3 then your grandma wears combat boots’ (?) ‘If I’m wealthy then the moon is not made of green cheese.’ (?) ‘If I’m not wealthy then the moon is not made of green cheese.’ (?)

More terminology QP is the CONVERSE of P  Q ¬ Q  ¬ P is the CONTRAPOSITIVE of P  Q ¬ P ¬ Q is the inverse of P  Q Example: Find the converse of the following statement: R: ‘Raining tomorrow is a sufficient condition for my not going to town.’

Procedure Step 1: Assign propositional variables to component propositions P: It will rain tomorrow Q: I will not go to town Step 2: Symbolize the assertion R: P  Q Step 3: Symbolize the converse Q  P Step 4: Convert the symbols back into words ‘If I don’t go to town then it will rain tomorrow’ Homework: Find inverse and contrapositive of statements above.

Definition 6: Biconditional ‘if and only if’, ‘iff’ Symbol: The biconditional statement pq is true when p and q have the same truth value, and is false otherwise. Biconditional statements are also called bi-implications. Example: P - ‘I am going to town’ Q - ‘It is going to rain’ P Q: ‘I am going to town if and only if it is going to rain.’

p:\msoffice\My Projects\Rosen 6e 2007\Imagebank\JPEGs07-24-06\ch01\jpeg\t01_1_006.jpg

Translating English Breaking assertions into component propositions - look for the logical operators! Example: ‘If I go to Harry’s or go to the country I will not go shopping.’ P: I go to Harry’s Q: I go to the country R: I will go shopping If......P......or.....Q.....then....not.....R (P Q)  ¬ R

Constructing a truth table one column for each propositional variable one for the compound proposition count in binary n propositional variables = 2n rows Construct the truth table for (P  ¬ Q)  (PQ) HW: Construct the truth table for (P Q)  ¬ R

p:\msoffice\My Projects\Rosen 6e 2007\Imagebank\JPEGs07-24-06\ch01\jpeg\t01_1_007.jpg

t01_1_008.jpg p:\msoffice\My Projects\Rosen 6e 2007\Imagebank\JPEGs07-24-06\ch01\jpeg\t01_1_008.jpg

What is the real meaning of ¬ PQ ? a) (¬ P) Q b) ¬ (PQ) What is the real meaning of PQR ? a) (PQ)R b) P(QR) What is the real meaning of P  QR ? a) (P  Q)R b) P  (QR)

p:\msoffice\My Projects\Rosen 6e 2007\Imagebank\JPEGs07-24-06\ch01\jpeg\t01_1_009.jpg

Logic and Bit Operations Example 20 Find the bitwise OR, bitwise AND, and bitwise XOR of the bit strings 01 1011 0110 and 11 0001 1101.

Logic Puzzles Example 18: There are two kind of inhabitants, knights, who always tell the truth, and their opposites, knaves, who always lie. You encounter two people A and B. What are A and B if A says “B is a knight” and B says “The two of us are opposite type”?

Proposition Negation Conjection Disjunction Exclusive OR Implication Terms Proposition Negation Conjection Disjunction Exclusive OR Implication Inverse Converse Contrapositive