Formal Proofs & F PHIL 012 - 01/31/2001. Outline Homework Problems 18-20 The FOL of F and Fitch notation Formal Proofs Assignment.

Slides:



Advertisements
Similar presentations
Artificial Intelligence
Advertisements

CS1502 Formal Methods in Computer Science Lecture Notes 3 Consequence Rules Boolean Connectives.
Introduction to Proofs
PROOF BY CONTRADICTION
Possible World Semantics for Modal Logic
1 Logic Logic in general is a subfield of philosophy and its development is credited to ancient Greeks. Symbolic or mathematical logic is used in AI. In.
F22H1 Logic and Proof Week 5 Overview of weeks 5—9 Predicates and Quantifiers.
1 Introduction to Abstract Mathematics Valid AND Invalid Arguments 2.3 Instructor: Hayk Melikya
For Wednesday, read Chapter 3, section 4. Nongraded Homework: Problems at the end of section 4, set I only; Power of Logic web tutor, 7.4, A, B, and C.
3.3 Divisibility Definition If n and d are integers, then n is divisible by d if, and only if, n = dk for some integer k. d | n  There exists an integer.
Logic 3 Tautological Implications and Tautological Equivalences
So far we have learned about:
On Monday, we’ll work on Chapter 2, sections 4 and 5. Exam #1 is one week from today. It covers Chapters 1 and 2 (except for chapter 2, section 6). On.
Reading: Chapter 4, section 4 Nongraded Homework: Problems at the end of section 4. Graded Homework #4 is due at the beginning of class on Friday. You.
Dr. Muhammed Al-Mulhem 1ICS ICS 535 Design and Implementation of Programming Languages Part 1 Fundamentals (Chapter 4) Axiomatic Semantics ICS 535.
EE1J2 – Discrete Maths Lecture 5 Analysis of arguments (continued) More example proofs Formalisation of arguments in natural language Proof by contradiction.
No new reading for Monday or Wednesday Exam #2 is next Friday, and we’ll review and work on proofs on Monday and Wed.
For Friday, read Chapter 3, section 4. Nongraded Homework: Problems at the end of section 4, set I only; Power of Logic web tutor, 7.4, A, B, and C. Graded.
Logical and Rule-Based Reasoning Part I. Logical Models and Reasoning Big Question: Do people think logically?
Exam 3 Material Inequalities and Absolute Value
Mathematical Induction Assume that we are given an infinite supply of stamps of two different denominations, 3 cents and and 5 cents. Prove using mathematical.
1.5 Rules of Inference.
Methods of Proof & Proof Strategies
Discrete Mathematics and Its Applications
Methods of Proof involving  Symbolic Logic February 19, 2001.
Week 3 - Monday.  What did we talk about last time?  Predicate logic  Multiple quantifiers  Negating multiple quantifiers  Arguments with quantified.
PHIL012 Class Notes 1/12/2001. Outline Announcements, web page Names and Predicates Sentences, claims, and truth value Atomic sentences Homework Problems.
0 Validity & Invalidity (Exercises) December 23, 2005.
COMMONWEALTH OF AUSTRALIA Copyright Regulations 1969 WARNING This material has been reproduced and communicated to you by or on behalf of Monash University.
Proofs1 Elementary Discrete Mathematics Jim Skon.
1 Sections 1.5 & 3.1 Methods of Proof / Proof Strategy.
1 Methods of Proof Proof techniques in this handout –Direct proof –Division into cases –Proof by contradiction In this handout, the proof techniques will.
PHIL012 Class Notes 1/15/2001. Outline Announcements, web page Review Homework Problems (1-7) Set Theory Review & Problem 8 (if time) Assignment for Wednesday.
C HAPTER 1 T OOLS OF G EOMETRY Section 1.1 Patterns and Inductive Reasoning.
Logical Reasoning:Proof Prove the theorem using the basic axioms of algebra.
2.8 Methods of Proof PHIL 012 1/26/2001.
0 Validity & Invalidity (Exercises) All dogs have two heads. 2. All tigers are dogs. ___________________________________ 3. All tigers have two.
Today’s Topics Introduction to Proofs Rules of Inference Rules of Equivalence.
1 Discrete Structures – CNS2300 Text Discrete Mathematics and Its Applications Kenneth H. Rosen (5 th Edition) Chapter 3 The Foundations: Logic and Proof,
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.
Fall 2008/2009 I. Arwa Linjawi & I. Asma’a Ashenkity 11 The Foundations: Logic and Proofs Rules of inference.
Mathematics for Comter I Lecture 2: Logic (1) Basic definitions Logical operators Translating English sentences.
The Logic of Atomic Sentences Chapter 2 Language, Proof and Logic.
Mathematical Induction
Copyright © Cengage Learning. All rights reserved. CHAPTER 8 RELATIONS.
Week 3 - Monday.  What did we talk about last time?  Predicate logic  Multiple quantifiers  Negating multiple quantifiers  Arguments with quantified.
Week 4 - Friday.  What did we talk about last time?  Floor and ceiling  Proof by contradiction.
(not about ships this time)
Logical Operators.  Quiz  Let's look at the schedule  Logical Operators 2.
Using Inductive Reasoning to Make Conjectures Geometry Farris 2015.
Foundations of Discrete Mathematics Chapter 1 By Dr. Dalia M. Gil, Ph.D.
More Proofs. REVIEW The Rule of Assumption: A Assumption is the easiest rule to learn. It says at any stage in the derivation, we may write down any.
Uniqueness Quantifier ROI for Quantified Statement.
Lecture 1 – Formal Logic.
Discrete Structures for Computer Science
Truth Trees.
Five step procedure for drawing conclusions.
Natural Deduction.
TRUTH TABLES.
Midterm Discussion.
Foundations of Discrete Mathematics
6.4 Truth Tables for Arguments
Logical and Rule-Based Reasoning Part I
Chapter 5 Parallel Lines and Related Figures
Solutions Homework 4 Problems
If there is any case in which true premises lead to a false conclusion, the argument is invalid. Therefore this argument is INVALID.
Introducing Natural Deduction
If there is any case in which true premises lead to a false conclusion, the argument is invalid. Therefore this argument is INVALID.
Derivations overview.
1-5 Conditional statements 1-6 deductive reasoning
Presentation transcript:

Formal Proofs & F PHIL /31/2001

Outline Homework Problems The FOL of F and Fitch notation Formal Proofs Assignment

Problem 18 Give a proof of a = c from the premises a = b and b = c using only the indiscernability of identicals. Indiscernability of Identicals: If a = b, then whatever we can say about a must be true of b as well

Problem 18 Continued Suppose that a = b and b = c. If a = b, then, anything we can say about b must be true of a as well. Since we know that b = c, a = c. Therefore, a = c.

Problem Premise: LeftOf(a, b); Conclusion: RightOf (b, a) Because LeftOf and RightOf are complimentary, the conclusion follows. We know this because there is no way of constructing a world in which LeftOf(a,b) is true and RightOf(b, a) is false.

Problem 19 Continued 2. Premises: LeftOf(a, b), b = c; Conclusion: RightOf(c, a). If b = c, anything we can say about b must be true of c as well, so we know LeftOf(a, c) is true. Because LeftOf(a, c) is true, RightOf(c, a) must be true as well.

Problem 19 Continued 3. Premises: LeftOf(a, b), RightOf(c, a); Conclusion: LeftOf(b, c) If we draw this on a sheet of paper or use Tarski’s world, we see that both premises could be true and the conclusion false because c could be between a and b. Two possibilities: a b c (conclusion is true) a c b (conclusion is false) A conclusion is not a logical consequences of the premises if there is at least one case where the premises could be true and the conclusion false.

Problem 19 Continued 4. Premises: BackOf(a, b), FrontOf(a, c); Conclusion: FrontOf(b, c) Because BackOf(a, b) means the same thing as FrontOf(b, a) and because if FrontOf(b, a) and FrontOf(a, c) we know that FrontOf(b, c)

Problem 19 Continued 5. Premises: Between(b, a, c), LeftOf(a, c); Conclusion: LeftOf(a, b) Recall the definition of Between… If a and c are in adjacent rows and if we draw a line from the midpoint of c to the midpoint of a, b is between if the line passes through it.

Problem 19 Continued Between(b, a, c) is true LeftOf(a, c) is true LeftOf(a, b) is false So LeftOf(a, b) does not follow from our premises. Remember: Our conclusion does not follow if there is at least one case in which the premises are true but the conclusion can be false. a b c

Problem Folly was Claire’s disk at 2 pm. 2. Silly was Max’s disk at 2 pm. 3. Silly was not Claire’s disk at 2 pm. Does 3 from 1 and 2? No. Consider: Owns(Claire, Silly, 2:00) and Owns(Claire,Folly, 2:00). (Nothing says she can’t own two disks at the same time).

Problem Folly was Claire’s disk at 2 pm. 2. Silly was Max’s disk at 2 pm. 3. Silly was not Claire’s disk at 2 pm. Does 2 follow from 1 and 3? Owns(Claire, Folly, 2:00) ~ Owns(Claire,Silly, 2:00) Do either of the propositions tell us anything about Max? No, because there is no rules that says that every student must own a disk.

Problem Folly was Claire’s disk at 2 pm. 2. Silly was Max’s disk at 2 pm. 3. Silly was not Claire’s disk at 2 pm. Does 1 follow from 2 and 3? Owns(Max, Silly, 2:00) ~ Owns(Claire,Silly, 2:00) Do either of the propositions tell us anything about Claire owning Folly? 2 does not follow because there’s no rule that says every disk must be owned by someone.

Fitch-style Notation For now, the important things to remember are Each statement gets its own line. A horizontal bar must separate premises from the rest of the proof. Every statement is numbered to aid in providing its rationale. You must provide a rationale (a rule and one or more numbers referring to a previously ascertained statement) for every new statement in the proof that is not a premise.

Fitch-style notation We need not worry about the vertical bar for now, but it will become important later. For now, just notice that the vertical bar means that all of the statements are part of the same proof.

Fitch notation 1. a = b 2. a = aRefl = 3. b = aInd Id: 2, 1 Premise(s) Conclusion Intermediate step(s) Rationales

Rules in F Reflexivity of Identity (Refl =) Informal: If a name “n” appears somewhere in your proof, you are entitled to say “n = n” Formal: n = n The arrow indicates the “conclusion” of the rule. That is, what you’re entitled to say.

Indiscernibility of Identicals (Ind Id): Informal: If you know that a = b, whatever you can say about a is true of b. Formal: P(n)    n = m    P(m) Rules in F

Rules using Word When you state rules in F … Don’t worry about the vertical bar (for now) Use “>” (greater than) for the arrow: P(n)    n = m    > P(m)

Notes on Proofs The “premises” of a rule must appear in the proof before its conclusion. There can be steps in between the “premises” of a rule. The “premises” of a rule do not have to be in any particular order.

Example Proof Given the rule, Trans LeftOf LeftOf(a, b)  LeftOf(b, c)  LeftOf(a, c) We can construct the following proof

Example proof Given LeftOf(a, b), LeftOf(b, c), and c = d, prove LeftOf(a, d). 1. LeftOf(a, b) 2. LeftOf(b, c) 3. c = d 4. LeftOf(a, c)Trans LeftOf: 1, 2 5. LeftOf(a, d)Ind Id: 3, 4

Assignment Problems due by 5pm Friday I will go over these problems on Friday. I’ll hand out a set of study questions on Friday that we will go over Monday and Wednesday. Exam 1 will be Friday, Feb. 9.