Truth and Proof Math vs. Reality Propositions & Predicates

Slides:



Advertisements
Similar presentations
9/2/2008 Warm Up Complete the conjecture by looking for a pattern in the diagram below. The number of sides of a polygon that has n vertices is________________.
Advertisements

Rules of Inference Rosen 1.5.
With examples from Number Theory
Introduction to Proofs
PROOF BY CONTRADICTION
Proofs, Recursion and Analysis of Algorithms Mathematical Structures for Computer Science Chapter 2 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesProofs,
Elementary Number Theory and Methods of Proof
– Alfred North Whitehead,
Induction and recursion
More Number Theory Proofs Rosen 1.5, 3.1. Prove or Disprove If m and n are even integers, then mn is divisible by 4. The sum of two odd integers is odd.
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.
Elementary Number Theory and Methods of Proof. Basic Definitions An integer n is an even number if there exists an integer k such that n = 2k. An integer.
So far we have learned about:
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.
Introduction to Proofs ch. 1.6, pg. 87,93 Muhammad Arief download dari
Propositional Logic Lecture 2: Sep 9. Conditional Statement If p then q p is called the hypothesis; q is called the conclusion “If your GPA is 4.0, then.
Adapted from Discrete Math
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.
CS 2210 (22C:019) Discrete Structures Logic and Proof Spring 2015 Sukumar Ghosh.
Propositional Logic.
Honors Geometry Section 1.0 Patterns and Inductive Reasoning
What is Critical Thinking?
Introduction to Proofs
MATH 224 – Discrete Mathematics
Methods of Proof. This Lecture Now we have learnt the basics in logic. We are going to apply the logical rules in proving mathematical theorems. Direct.
CSE 311: Foundations of Computing Fall 2013 Lecture 8: More Proofs.
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
Discrete Structures (DS)
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.
Course Overview and Road Map Computability and Logic.
Hazırlayan DISCRETE COMPUTATIONAL STRUCTURES Propositional Logic PROF. DR. YUSUF OYSAL.
CompSci 102 Discrete Math for Computer Science
René Descartes, Meditations Introduction to Philosophy Jason M. Chang.
CompSci 102 Discrete Math for Computer Science March 1, 2012 Prof. Rodger Slides modified from Rosen.
4.1 Proofs and Counterexamples. Even Odd Numbers Find a property that describes each of the following sets E={…, -4, -2, 0, 2, 4, 6, …} O={…, -3, -1,
CSS342: Quantifiers1 Professor: Munehiro Fukuda. CSS342: Quantifiers2 Review of Propositions Proposition: a statement that is either true or false, but.
First Order Logic Lecture 3: Sep 13 (chapter 2 of the book)
Chapter 5. Section 5.1 Climbing an Infinite Ladder Suppose we have an infinite ladder: 1.We can reach the first rung of the ladder. 2.If we can reach.
ICS 6D Logic Overview Instructor: Sandy Irani. What is logic? Branch of mathematics in which variables and expressions have value true (T) or false (F)
Inductive Reasoning Section 1.2. Objectives: Use inductive reasoning to make conjectures.
Chapter 5 1. Chapter Summary  Mathematical Induction  Strong Induction  Recursive Definitions  Structural Induction  Recursive Algorithms.
Lecture 2: Proofs and Recursion. Lecture 2-1: Proof Techniques Proof methods : –Inductive reasoning Lecture 2-2 –Deductive reasoning Using counterexample.
Chapter 1 Logic and Proof.
CS 2210:0001 Discrete Structures Logic and Proof
Discrete Mathematical
Intuition and deduction thesis (rationalism)
CSE15 Discrete Mathematics 02/08/17
Chapter 4 (Part 1): Induction & Recursion
Argument An argument is a sequence of statements.
Conditional Statements
Discrete Mathematics Logic.
Methods of proof Section 1.6 & 1.7 Wednesday, June 20, 2018
Induction and recursion
Predicate Calculus Validity
Proof Techniques.
The Foundations: Logic and Proofs
Induction and recursion
Mathematics for Computer Science MIT 6.042J/18.062J
CS 220: Discrete Structures and their Applications
Propositional Logic.
First Order Logic Rosen Lecture 3: Sept 11, 12.
Mathematics for Computer Science MIT 6.042J/18.062J
Discrete Mathematics Logic.
2.2 Patterns & Inductive Reasoning
Dr. Halimah Alshehri MATH 151 Dr. Halimah Alshehri Dr. Halimah Alshehri.
Agenda Proofs (Konsep Pembuktian) Direct Proofs & Counterexamples
Write the negation of each of the following propositions without using any form of the word “not”: Today is Thursday Today is Monday or Tuesday or Wednesday.
1.1 Patterns and Inductive Reasoning
Presentation transcript:

Truth and Proof Math vs. Reality Propositions & Predicates Mathematics for Computer Science MIT 6.042J/18.062J Truth and Proof Math vs. Reality Propositions & Predicates Copyright © Albert Meyer, 2002. Prof. Albert Meyer & Dr. Radhika Nagpal

Only Prime Numbers? Let . Hypothesis: is a prime number

. . . . . . Only Prime Numbers? Evidence: prime prime prime prime prime looking good! . . . prime enough already!

Let . is a prime number Only Prime Numbers? This can’t be a coincidence. The hypothesis must be true.

Let . is a prime number Only Prime Numbers? This can’t be a coincidence. The hypothesis must be true. BUT NOT TRUE: is NOT PRIME.

Prove that 1601 is prime, and 1681 is not prime. Only Prime Numbers? EXERCISE: Prove that 1601 is prime, and 1681 is not prime.

Further Extreme Example EULER'S CONJECTURE (1769) has no solution when are positive integers:

Further Extreme Example EULER'S CONJECTURE (1769) Counterexample: 218 years later by Noam Elkies at Liberal Arts school up Mass Ave:

Further Extreme Example Hypothesis: has no natural number solution.

Further Extreme Example Hypothesis: has no natural number solution. False. But smallest counterexample has MORE THAN 1000 digits!

MATHEMATICIAN: 3 is prime, 5 is prime, Evidence vs. Proof Claim: All odd numbers greater than 1 are prime. MATHEMATICIAN: 3 is prime, 5 is prime, 7 is prime, but is not prime, so the proposition is false!

Evidence vs. Proof Claim: All odd numbers greater than 1 are prime. PHYSICIST: 3 is prime, 5 is prime, 7 is prime, 9 is not prime, but 11 is prime, 13 is prime. So 9 must be experimental error; the proposition is true!

LAWYER: Ladies and Gentleman of the Evidence vs. Proof Claim: All odd numbers greater than 1 are prime. LAWYER: Ladies and Gentleman of the jury, it is beyond all reasonable doubt that odd numbers are prime. The evidence is clear: 3 is prime, 5 is prime, 7 is prime, 9 is prime, 11 is prime, and so on.

Math Sets Numbers Booleans Strings Functions Relations Vectors

Not Math Solar System

Not Math Physical Motion

Not Math Family

Not Math Cats

René Descartes' MEDITATIONS Cogito ergo sum René Descartes' MEDITATIONS (Picture source: http://www.btinternet.com/~glynhughes/squashed/descartes.htm)

and the Distinction Between Mind and Body are Demonstrated. Cogito ergo sum René Descartes' MEDITATIONS on First Philosophy in which the Existence of God and the Distinction Between Mind and Body are Demonstrated.

Propositional (Boolean) Logic Proposition is either True or False

Propositional (Boolean) Logic Proposition is either True or False Example:

Propositional (Boolean) Logic Proposition is either True or False Example: Nonexamples: Wake up! Where am I?

Operators (if and only if)

Deductions A student is trying to prove that propositions P, Q, and R are all true. She proceeds as follows. First, she proves three facts: P implies Q, Q implies R, and R implies P. Then she concludes, ``Thus obviously P, Q, and R are all true.''

Deductions A student is trying to prove that propositions P, Q, and R are all true. She proceeds as follows. First, she proves three facts: P implies Q, Q implies R, and R implies P. Then she concludes, ``Thus obviously P, Q, and R are all true.''

Truth Table Could use a truth table. Conclusion (below the line) must be true whenever Hypotheses (above the line) are true.

Could use a truth table. Conclusion (below the line) must be true whenever Hypotheses (above the line) are true. T T T T T F T F T T F F F T T F T F F F T F F F

Conclusion (below the line) must be true whenever Truth Table Conclusion (below the line) must be true whenever Hypotheses (above the line) are true. T T T T T T F F T F T F T F F F F T T F F T F F F F T F F F F T

Conclusion (below the line) must be true whenever Truth Table Conclusion (below the line) must be true whenever Hypotheses (above the line) are true. T T F F T F OK NOT OK!

Every even integer greater than 2 is the sum of two primes. Goldbach Conjecture Every even integer greater than 2 is the sum of two primes.

. . . Every even integer greater than 2 is the sum of two primes. Goldbach Conjecture Every even integer greater than 2 is the sum of two primes. Evidence: . . .

. . . Every even integer greater than 2 is the sum of two primes. Goldbach Conjecture Every even integer greater than 2 is the sum of two primes. Evidence: . . .

up to 13 digits! True for all even numbers with Goldbach Conjecture It remains an OPEN problem: no counterexample, no proof. (Rosen, p.182)

up to 13 digits! True for all even numbers with Goldbach Conjecture It remains an OPEN problem: no counterexample, no proof. (Rosen, p.182) UNTIL NOW!…

Goldbach Conjecture The answer is on my desk!

Goldbach Conjecture The answer is on my desk! (Proof by Cases)

Quicker by Cases Case 1: P is true. If the Hypothesis is true, then q must be true (because p implies q). Then r must be true (because q implies r). So the conclusion is true OK.

Quicker by Cases Case 2: P is false. If the Hypothesis is true, then q must be false (because p implies q). Then r must be false (because q implies r). So the conclusion is (very) False

Tutorial Problems 1 & 2

Predicates Predicates are Propositions with variables: Example:

Predicates For x = 1 and y = 3, equation is true: is true For x = 1 and y = 4, equation is false: is false

Quantifiers For ALL x There EXISTS some y

Quantifiers For ALL x There EXISTS some y x, y range over Domain of Discourse True over Domain

Quantifiers For ALL x There EXISTS some y x, y range over Domain of Discourse True over Domain False over Domain

Quantifiers True over positive real numbers, False over negative real numbers,

Validity True no matter what predicate Q is, the Domain is.

Tutorial Exercises 3-5