CS 1502 Formal Methods in Computer Science

Slides:



Advertisements
Similar presentations
CS1502 Formal Methods in Computer Science Lecture Notes 3 Consequence Rules Boolean Connectives.
Advertisements

Introduction to Proofs
The Foundations: Logic and Proofs
1 CS1502 Formal Methods in Computer Science Lecture Notes 4 Tautologies and Logical Truth.
Chapter 1 The Logic of Compound Statements. Section 1.3 Valid & Invalid Arguments.
Logic 2 The conditional and biconditional
Today’s Topics n Symbolizing conditionals and bi-conditionals n Other complex symbolizations. n Unless.
1 Discrete Structures CS Johnnie Baker Comments on Early Term Test.
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
From Chapter 4 Formal Specification using Z David Lightfoot
1 Inference Rules and Proofs Z: Inference Rules and Proofs.
1 Inference Rules and Proofs Z: Inference Rules and Proofs.
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.
EE1J2 – Discrete Maths Lecture 5 Analysis of arguments (continued) More example proofs Formalisation of arguments in natural language Proof by contradiction.
Rosen 1.6. Approaches to Proofs Membership tables (similar to truth tables) Convert to a problem in propositional logic, prove, then convert back Use.
CS1502 Formal Methods in Computer Science Lecture Notes 10 Resolution and Horn Sentences.
Methods of Proof & Proof Strategies
CS1502 Formal Methods in Computer Science Lecture Notes 1 Course Information Introduction to Logic Part 1.
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.
COMMONWEALTH OF AUSTRALIA Copyright Regulations 1969 WARNING This material has been reproduced and communicated to you by or on behalf of Monash University.
1 Inference Rules and Proofs (Z); Program Specification and Verification Inference Rules and Proofs (Z); Program Specification and Verification.
DeMorgan’s Rule DM ~(p v q) :: (~p. ~q)“neither…nor…” is the same as “not the one and not the other” ~( p. q) :: (~p v ~q) “not both…” is the same as “either.
CSE 311 Foundations of Computing I Lecture 8 Proofs and Set Theory Spring
1 Math/CSE 1019C: Discrete Mathematics for Computer Science Fall 2011 Suprakash Datta Office: CSEB 3043 Phone: ext
Advanced Topics in Propositional Logic Chapter 17 Language, Proof and Logic.
INTRODUCTION TO LOGIC Jennifer Wang Fall 2009 Midterm Review Quiz Game.
1 CMSC 250 Discrete Structures CMSC 250 Lecture 1.
CS 381 DISCRETE STRUCTURES Gongjun Yan Aug 25, November 2015Introduction & Propositional Logic 1.
1 Introduction to Abstract Mathematics Expressions (Propositional formulas or forms) Instructor: Hayk Melikya
CSE 311 Foundations of Computing I Lecture 9 Proofs and Set Theory Autumn 2012 CSE
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.
Methods of Proof for Boolean Logic Chapter 5 Language, Proof and Logic.
Predicates and Quantifiers Dr. Yasir Ali. 1.Predicates 2.Quantifiers a.Universal Quantifiers b.Existential Quantifiers 3.Negation of Quantifiers 4.Universal.
The Logic of Atomic Sentences Chapter 2 Language, Proof and Logic.
CS104:Discrete Structures Chapter 2: Proof Techniques.
CSE 311: Foundations of Computing Fall 2013 Lecture 8: Proofs and Set theory.
Methods of Proof – Page 1CSCI 1900 – Discrete Structures CSCI 1900 Discrete Structures Methods of Proof Reading: Kolman, Section 2.3.
1 CS1502 Formal Methods in Computer Science Notes 15 Problem Sessions.
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.
Lecture 10 Methods of Proof CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
1 Georgia Tech, IIC, GVU, 2006 MAGIC Lab Rossignac Lecture 01: Boolean Logic Sections 1.1 and 1.2 Jarek Rossignac.
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.
Foundations of Computing I CSE 311 Fall Announcements Homework #2 due today – Solutions available (paper format) in front – HW #3 will be posted.
The Foundations: Logic and Proofs
CS 2210:0001 Discrete Structures Logic and Proof
Discrete Mathematical
2. The Logic of Compound Statements Summary
Proof by Contradiction
CSE 311 Foundations of Computing I
Today’s Topics Symbolizing conditionals and bi-conditionals
Lecture Notes 8 CS1502.
MATH 245 Spring 2009 This is mathematics for computer science
Biconditional - 2 CS-708.
Jeffrey Martinez Math 170 Dr. Lipika Deka 10/15/13
Principles of Computing – UFCFA3-30-1
Information Technology Department
CS 1502 Formal Methods in Computer Science
The Foundations: Logic and Proofs
CSE 311 Foundations of Computing I
CS1502 Formal Methods in Computer Science
CSE 311: Foundations of Computing
CS 220: Discrete Structures and their Applications
Propositional Logic.
The Foundations: Logic and Proofs
Presentation transcript:

CS 1502 Formal Methods in Computer Science Lecture Notes 11

Example Infer A  C from A  B and B  C. A B B  C A  C This argument is known as the Transitivity of the Biconditional.

Using Resolution A  B is (A  B)  (B  A) B  C is (B  C)  (C  B) (A  C) is (A  C )  (A  C) {A, B} {B,A} {B, C} {C, B} {A, C} {A, C} Resolution Proof: In Lecture

Using Fitch

Law of Excluded Middle P  P A Tautology

Exercise 6.33 (in the pdf solution)

Exercise 6.33 (shorter version)

Using DeMorgan’s, with Taut Con doing the work for you

Using DeMorgan’s, but we do the work…(turns out to be redundant)

Law of Excluded Middle P  P Use with V-Elim in Proofs! To introduce it: Use Taut Con, if the rules allow Otherwise, insert proof 6.33

Exercise 8.53 (on LPL Web site) Note: Fitch lines after line 4 And 11 were eaten by adobe. They should be there.

Example Prove this argument is valid from no premises. (P  Q) (P  Q) Logical truth

Example

Prove this argument Horned(unicorn)  (Elusive(unicorn)  Dangerous(unicorn)) (Elusive(unicorn)  Mythical(unicorn))  Rare(unicorn) Mammal(unicorn)  Rare(unicorn) Horned(unicorn)   Mammal(unicorn) Proof is on the next slide; Go through it for practice on your own.

1. Horned(unicorn)  (Elusive(unicorn)  Dangerous(unicorn) 2 1. Horned(unicorn)  (Elusive(unicorn)  Dangerous(unicorn) 2. (Elusive(unicorn)  Mythical(unicorn))  Rare(unicorn) 3. Mammal(unicorn)  Rare(unicorn) 4. Horned(unicorn) 5. Elusive(unicorn)  Dangerous(unicorn)  Elim 1,4 6. Elusive(unicorn)  Elim 5 7. Elusive(unicorn)  Mythical(unicorn)  Intro 8. Rare(unicorn)  Elim 2,7 9. Mammal(unicorn) 10. Rare(unicorn)  Elim 3,9 11.   Intro 8,10 12.  Mammal(unicorn)  Intro 9-11 13. Horned(unicorn)   Mammal(unicorn) Intro 4-12

Informal Proof Example Prove there exists irrational numbers b and c such that bc is rational. Proof: Consider  = 22. This number is either rational or irrational. If  is rational we are finished since b = c = 2 . Assume  is irrational. Consider   2 = 2. Again we are finished since b =  and c = 2.

English Translation EGs P  Q If P then Q (If you are human then you are a mammal) P implies Q (Being a human implies being a mammal) If P, Q (If you are human, you are a mammal) P only if Q (You’ll live a long time only if you eat veggies) P is sufficient for Q (Knowing you’re living a long time is sufficient to know you eat veggies) Q is necessary for P (Eating veggies is necessary to live a long time) Q if P (You are a mammal if you are human)

P  Q Home(max)  Library(claire) Large(b)  Cube(b) If not P then Q If Max is not home, then Claire is at the library If b is not large, then it is a cube Unless P, Q Unless Max is at home, Claire is at the library Unless b is large, b is a cube Q, unless P Claire is at the library unless Max is home B is a cube unless b is large Why not  for last two? (section 7.3 and lecture)

Lecture: look at related questions on Assignment 3, in 7.12 and 7.15