Foundations of Computing I CSE 311 Fall 2014. Announcements Homework #2 due today – Solutions available (paper format) in front – HW #3 will be posted.

Slides:



Advertisements
Similar presentations
Introduction to Proofs
Advertisements

PROOF BY CONTRADICTION
Chapter 1: The Foundations: Logic and Proofs 1.1 Propositional Logic 1.2 Propositional Equivalences 1.3 Predicates and Quantifiers 1.4 Nested Quantifiers.
Deduction In addition to being able to represent facts, or real- world statements, as formulas, we want to be able to manipulate facts, e.g., derive new.
22C:19 Discrete Structures Logic and Proof Spring 2014 Sukumar Ghosh.
Logic and Proof. Argument An argument is a sequence of statements. All statements but the first one are called assumptions or hypothesis. The final statement.
CSE 311 Foundations of Computing I Lecture 6 Predicate Logic Autumn 2011 CSE 3111.
First Order Logic (chapter 2 of the book) Lecture 3: Sep 14.
Proof by Deduction. Deductions and Formal Proofs A deduction is a sequence of logic statements, each of which is known or assumed to be true A formal.
Introduction to Proofs ch. 1.6, pg. 87,93 Muhammad Arief download dari
Fall 2002CMSC Discrete Structures1 Let’s proceed to… Mathematical Reasoning.
First Order Logic. This Lecture Last time we talked about propositional logic, a logic on simple statements. This time we will talk about first order.
CSE 311 Foundations of Computing I Lecture 6 Predicate Logic, Logical Inference Spring
Methods of Proof & Proof Strategies
Introduction to Proofs
1 Georgia Tech, IIC, GVU, 2006 MAGIC Lab Rossignac Lecture 03: PROOFS Section 1.5 Jarek Rossignac CS1050: Understanding.
MATH 224 – Discrete Mathematics
CSE 311: Foundations of Computing Fall 2013 Lecture 8: More Proofs.
Proofs1 Elementary Discrete Mathematics Jim Skon.
CSci 2011 Discrete Mathematics Lecture 6
CSE 311 Foundations of Computing I Lecture 8 Proofs and Set Theory Spring
1 Sections 1.5 & 3.1 Methods of Proof / Proof Strategy.
1 Math/CSE 1019C: Discrete Mathematics for Computer Science Fall 2011 Suprakash Datta Office: CSEB 3043 Phone: ext
First Order Logic Lecture 2: Sep 9. This Lecture Last time we talked about propositional logic, a logic on simple statements. This time we will talk about.
Chap 3 –A theorem is a statement that can be shown to be true –A proof is a sequence of statements to show that a theorem is true –Axioms: statements which.
CSE 311 Foundations of Computing I Lecture 7 Logical Inference Autumn 2012 CSE
1 Introduction to Abstract Mathematics Chapter 2: The Logic of Quantified Statements. Predicate Calculus Instructor: Hayk Melikya 2.3.
1 Discrete Structures – CNS2300 Text Discrete Mathematics and Its Applications Kenneth H. Rosen (5 th Edition) Chapter 3 The Foundations: Logic and Proof,
CSE 311 Foundations of Computing I Lecture 9 Proofs and Set Theory Autumn 2012 CSE
Chapter 2 Symbolic Logic. Section 2-1 Truth, Equivalence and Implication.
First Order Logic Lecture 3: Sep 13 (chapter 2 of the book)
22C:19 Discrete Structures Logic and Proof Fall 2014 Sukumar Ghosh.
CSci 2011 Discrete Mathematics Lecture 4 CSci 2011.
CSE 311: Foundations of Computing Fall 2013 Lecture 8: Proofs and Set theory.
Week 4 - Friday.  What did we talk about last time?  Floor and ceiling  Proof by contradiction.
1 Chapter 2.1 Chapter 2.2 Chapter 2.3 Chapter 2.4 All images are copyrighted to their respective copyright holders and reproduced here for academic purposes.
Section 1.7. Definitions A theorem is a statement that can be shown to be true using: definitions other theorems axioms (statements which are given as.
CSE 311 Foundations of Computing I Lecture 8 Proofs Autumn 2011 CSE 3111.
CSE 311 Foundations of Computing I Lecture 8 Proofs Autumn 2012 CSE
The Logic of Conditionals Chapter 8 Language, Proof and Logic.
Discrete Mathematical Structures: Theory and Applications 1 Logic: Learning Objectives  Learn about statements (propositions)  Learn how to use logical.
CSci 2011 Discrete Mathematics Lecture 5 CSci 2011.
Chapter 1, Part III: Proofs With Question/Answer Animations Copyright © McGraw-Hill Education. All rights reserved. No reproduction or distribution without.
Section 1.7. Section Summary Mathematical Proofs Forms of Theorems Direct Proofs Indirect Proofs Proof of the Contrapositive Proof by Contradiction.
Hubert Chan (Chapters 1.6, 1.7, 4.1)
The Foundations: Logic and Proofs
CSE 311 Foundations of Computing I
CSE 311 Foundations of Computing I
CSE 311 Foundations of Computing I
CSE 311 Foundations of Computing I
CSE 311 Foundations of Computing I
Predicate Calculus Validity
Chapter 1: The Foundations: Logic and Proofs
CSE 311: Foundations of Computing
Hubert Chan (Chapters 1.6, 1.7, 4.1)
CS201: Data Structures and Discrete Mathematics I
The Foundations: Logic and Proofs
CSE 311 Foundations of Computing I
Mathematical Reasoning
CSE 311: Foundations of Computing
CSE 311: Foundations of Computing
First Order Logic Rosen Lecture 3: Sept 11, 12.
Negations of quantifiers
CSE 321 Discrete Structures
This Lecture Substitution model
CS201: Data Structures and Discrete Mathematics I
Mathematical Reasoning
CSE 311: Foundations of Computing
CSE 321 Discrete Structures
Agenda Proofs (Konsep Pembuktian) Direct Proofs & Counterexamples
Presentation transcript:

Foundations of Computing I CSE 311 Fall 2014

Announcements Homework #2 due today – Solutions available (paper format) in front – HW #3 will be posted tonight

Inference Rules Each inference rule is written as:...which means that if both A and B are true then you can infer C and you can infer D. – For rule to be correct (A  B)  C and (A  B)  D must be a tautologies Sometimes rules don’t need anything to start with. These rules are called axioms: – e.g. Excluded Middle Axiom A, B ∴ C,D ∴ p  p

Simple Propositional Inference Rules Excluded middle plus two inference rules per binary connective, one to eliminate it and one to introduce it p  q ∴ p, q p, q ∴ p  q p ∴ p  q, q  p p  q,  p ∴ q p, p  q ∴ q p  q ∴ p  q Direct Proof Rule Not like other rules Intro Elim  

Important: Application of Inference Rules You can use equivalences to make substitutions of any sub-formula. Inference rules only can be applied to whole formulas (not correct otherwise). e.g. 1. p  q given 2. ( p  r)  q intro  from 1. Does not follow! e.g. p=F, q=F, r=T

CSE 311: Foundations of Computing Fall 2013 Lecture 7: Proofs

Proofs Show that  r follows from p  s, q   r, and s  q.

Direct Proof of an Implication p  q denotes a proof of q given p as an assumption The direct proof rule: If you have such a proof then you can conclude that p  q is true Example:1. p assumption 2. p  q intro for  from 1 3. p  (p  q) direct proof rule proof subroutine

Proofs using the direct proof rule Show that p  r follows from q and (p  q)  r 1. q given 2. (p  q)  r given 3. p assumption 4. p  q from 1 and 3 via Intro  rule 5. r modus ponens from 2 and 4 6. p  r direct proof rule

Example Prove: (p  q)  (p  q)

Example Prove: ((p  q)  (q  r))  (p  r)

One General Proof Strategy 1.Look at the rules for introducing connectives to see how you would build up the formula you want to prove from pieces of what is given 2.Use the rules for eliminating connectives to break down the given formulas so that you get the pieces you need to do 1. 3.Write the proof beginning with what you figured out for 2 followed by 1.

Inference rules for quantifiers ∴  x P(x)  x P(x) ∴  x P(x)  x P(x) * in the domain of P P(c) for some c ∴ P(a) for any a “ Let a be anything * ”...P(a) ∴ P(c) for some special** c ** By special, we mean that c is a name for a value where P(c) is true. We can’t use anything else about that value, so c has to be a NEW variable!

Proofs using Quantifiers “There exists an even prime number” Prime(x): x is an integer > 1 and x is not a multiple of any integer strictly between 1 and x

Even and Odd Prove: “The square of every even number is even.” Formal proof of:  x (Even(x)  Even(x 2 )) Even(x)   y (x=2y) Odd(x)   y (x=2y+1) Domain: Integers

Even and Odd Prove: “The square of every odd number is odd” English proof of:  x (Odd(x)  Odd(x 2 )) Let x be an odd number. Then x=2k+1 for some integer k (depending on x) Therefore x 2 =(2k+1) 2 = 4k 2 +4k+1=2(2k 2 +2k)+1. Since 2k 2 +2k is an integer, x 2 is odd. Even(x)   y (x=2y) Odd(x)   y (x=2y+1) Domain: Integers

Proof by Contradiction: One way to prove  p If we assume p and derive False (a contradiction), then we have proved  p. 1. p assumption F 4. p  F direct Proof rule 5.  p  F equivalence from 4 6.  p equivalence from 5