321 Section, Week 2 Natalie Linnell. Extra Credit problem.

Slides:



Advertisements
Similar presentations
Rules of Inference Rosen 1.5.
Advertisements

The Foundations: Logic and Proofs
Chapter 1: The Foundations: Logic and Proofs 1.1 Propositional Logic 1.2 Propositional Equivalences 1.3 Predicates and Quantifiers 1.4 Nested Quantifiers.
Lab 1 Chapter 1, Sections 1.1, 1.2, 1.3, and 1.4 Book: Discrete Mathematics and Its Applications By Kenneth H. Rosen.
CSE115/ENGR160 Discrete Mathematics 01/26/12 Ming-Hsuan Yang UC Merced 1.
Valid Arguments An argument is a sequence of propositions. All but the final proposition are called premises. The last statement is the conclusion. The.
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.
Discrete Mathematics Lecture 2 Alexander Bukharovich New York University.
Ch 1.3: Quantifiers Open sentences, or predicates, are sentences that contain one or more variables. They do not have a truth value until variables are.
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.
CSE115/ENGR160 Discrete Mathematics 01/20/11 Ming-Hsuan Yang UC Merced 1.
Quantifiers and Negation Predicates. Predicate Will define function. The domain of a function is the set from which possible values may be chosen for.
EE1J2 - Slide 1 EE1J2 – Discrete Maths Lecture 11 Introduction to Predicate Logic Limitations of Propositional Logic Predicates, quantifiers and propositions.
Lecture # 21 Predicates & Quantifiers
1 Predicates and Quantifiers CS 202, Spring 2007 Epp, Sections 2.1 and 2.2 Aaron Bloomfield.
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.
Predicates and Quantifiers
Chapter 1: The Foundations: Logic and Proofs
Discrete Mathematics and Its Applications Sixth Edition By Kenneth Rosen Chapter 1 The Foundations: Logic and Proofs 歐亞書局.
(CSC 102) Lecture 7 Discrete Structures. Previous Lectures Summary Predicates Set Notation Universal and Existential Statement Translating between formal.
1 Predicates and Quantifiers CS/APMA 202, Spring 2005 Rosen, section 1.3 Aaron Bloomfield.
Chapter 2 The Logic of Quantified Statements. Section 2.4 Arguments with Quantified Statements.
Nested Quantifiers. 2 Nested Iteration Let the domain be {1, 2, …, 10}. Let P(x, y) denote x > y.  x,  y, P(x, y) means  x, (  y, P(x, y) ) Is the.
Section 1.5. Section Summary Nested Quantifiers Order of Quantifiers Translating from Nested Quantifiers into English Translating Mathematical Statements.
Predicates and Quantified Statements M , 3.2.
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.
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
Lecture 1.2: Equivalences, and Predicate Logic* CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from previous lectures by Cinda Heeren, Zeph.
Statements with Multiple Quantifiers. When a statement contains more than one quantifier, we imagine the actions suggested by the quantifiers as being.
CS203 Discrete Mathematical Structures Logic (2).
Math 51/COEN 19 Day 3, 1.4 Quantifiers 1. 3 Predicates A lot like functions that return booleans Let P(x) denote x
Discrete Mathematics. Predicates - the universal quantifier 11/28/2015 Suppose P(x) is a predicate on some universe of discourse. Ex. B(x) = “x is carrying.
(CSC 102) Lecture 8 Discrete Structures. Previous Lectures Summary Predicates Set Notation Universal and Existential Statement Translating between formal.
Chapter 2 The Logic of Quantified Statements. Section 2.1 Intro to Predicates & Quantified Statements.
CompSci 102 Discrete Math for Computer Science January 24, 2012 Prof. Rodger Slides modified from Rosen.
1 Georgia Tech, IIC, GVU, 2006 MAGIC Lab Rossignac Lecture 02: QUANTIFIERS Sections 1.3 and 1.4 Jarek Rossignac CS1050:
CSE 321 Discrete Structures Winter 2008 Lecture 5 Rules of Inference.
Lecture 7 – Jan 28, Chapter 2 The Logic of Quantified Statements.
Fall 2008/2009 I. Arwa Linjawi & I. Asma’a Ashenkity 1 The Foundations: Logic and Proofs Predicates and Quantifiers.
Lecture 8 Predicate Logic TF4233 Mathematical Logic Semester 2, 2006/2007 Dr. Rolly Intan & Cherry Ballangan, MAIT Informatics Department, Petra Christian.
Discrete Structures Predicate Logic 1 Dr. Muhammad Humayoun Assistant Professor COMSATS Institute of Computer Science, Lahore.
First Order Logic Lecture 3: Sep 13 (chapter 2 of the book)
Rules of Inference Section 1.6. Arguments in Propositional Logic A argument in propositional logic is a sequence of propositions. All but the final proposition.
Method of proofs.  Consider the statements: “Humans have two eyes”  It implies the “universal quantification”  If a is a Human then a has two eyes.
Lecture 1.2: Equivalences, and Predicate Logic CS 250, Discrete Structures, Fall 2015 Nitesh Saxena Adopted from previous lectures by Cinda Heeren, Zeph.
Fall 2008/2009 I. Arwa Linjawi & I. Asma’a Ashenkity 11 The Foundations: Logic and Proofs Rules of inference.
Predicates and Quantifiers
CSci 2011 Discrete Mathematics Lecture 4 CSci 2011.
Discrete Mathematics Mathematical reasoning: think logically; know how to prove Combinatorial analysis: know how to count Discrete structures: represent.
Mathematics for Comter I Lecture 3: Logic (2) Propositional Equivalences Predicates and Quantifiers.
1 Introduction to Abstract Mathematics Chapter 3: The Logic of Quantified Statements. Predicate Calculus Instructor: Hayk Melikya 3.1.
Section 1.4. Propositional Functions Propositional functions become propositions (and have truth values) when their variables are each replaced by a value.
Introduction to Predicates and Quantified Statements I Lecture 9 Section 2.1 Wed, Jan 31, 2007.
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.
Introduction to Discrete Mathematics Discrete Mathematics: is the part of mathematics devoted to the study of discrete objects. Discrete Mathematics is.
رياضيات متقطعة لعلوم الحاسب MATH 226. Chapter 1 Predicates and Quantifiers 1.4.
Lecture 1.2: Equivalences, and Predicate Logic
3. The Logic of Quantified Statements Summary
Discrete Mathematics Logic.
Discrete Mathematics.
CS203 Discrete Mathematical Structures
Chapter 1 The Foundations: Logic and Proofs
Introduction to Predicates and Quantified Statements II
Introduction to Predicates and Quantified Statements I
CSE 321 Discrete Structures
Discrete Mathematics Logic.
Discrete Mathematics CMP-200 Propositional Equivalences, Predicates & Quantifiers, Negating Quantified Statements Abdul Hameed
Discrete Mathematics Lecture 4 Logic of Quantified Statements
Presentation transcript:

321 Section, Week 2 Natalie Linnell

Extra Credit problem

All lions are fierce Some lions do not drink coffee Some fierce creatures do not drink coffee Translate into logic (provide defs for predicates) Ax(P(x)->Q(x)), Ex(P(x)/\-R(x)), Ex(Q(x)/\-R(x)

Discussion Discuss: Why A->? Why not A/\? Why E/\? Why not E->?

Negate all the statements All lions are fierce Some lions do not drink coffee Some fierce creatures do not drink coffee Ex(P(x)/\-Q(x)), Ax(-P(x)vR(x)), Ax(-Q(x)vR(x))

All lions are fierce Some lions do not drink coffee Some fierce creatures do not drink coffee Argue whether the reasoning to conclude the third statement from the first two is sound Yes; 2existential instationiation;1 universal instantiation

All hummingbirds are richly colored No large birds live on honey Birds that do not live on honey are dull in color Hummingbirds are small Translate into logic (define any predicates used) Ax(P(x)->S(x)), -Ex(Q(x)/\R(x)), Ax(-R(x)->-S(x)), Ax(P(x)->-Q(x))

All hummingbirds are richly colored No large birds live on honey Birds that do not live on honey are dull in color Hummingbirds are small Negate all the statements Ex(P(x)/\-S(x)), Ex(Q(x)/\R(x)),Ex(-R(x)/\S(x)), Ex(P(x)/\Q(x))

Argue whether the fourth statement follows from the first 3 All hummingbirds are richly colored No large birds live on honey Birds that do not live on honey are dull in color Hummingbirds are small Yes; 1, 3 contrapositive and modus ponens, 2(modus ponens if in ->; else -/\ means if one true other false)

Show that  xP(x)  xQ(x) is not equivalent to  x(P(x)  Q(x)) Let P(x) and Q(x) be statements from math or the world to illustrate this. P(x)=x is positive, Q(x)=x is negative; any two contradictory statements would do

There is a student in this class who has been in every room of at least one building on campus Translate into logic (define any predicates) ExEyAz(P(z,y)->Q(x,y))

Every student in this class has been in at least one room of every building on campus Translate into logic (define any predicates) AxAyEz(P(z,y)/\Q(x, z))

 x  y (xy = y) Domain is real numbers – what concept does this capture? Multiplicative identity

 x  y (((x 0)) Domain is real numbers – what concept does this capture? Product of two negative integers is positive.

Everyone has exactly one best friend Translate into logic – do not use uniqueness quantifier AxEy(B(x,y)/\Az(x!=y)->-B(x,z)

It is not sunny this afternoon and it is colder than yesterday We will go swimming only if it’s sunny If we do not go swimming, then we will take a canoe trip If we take a canoe trip, then we will be home by sunset Show that “We will be home by sunset” follows 1.5 eg 6

Negate  x  y P(x, y) v  x  y Q(x, y)

Negate  x  y (P(x, y)  Q(x,y))