Xuan Guo xguo9@student.gsu.edu Lab 3 Xuan Guo xguo9@student.gsu.edu.

Slides:



Advertisements
Similar presentations
Nested Quantifiers Section 1.4.
Advertisements

Nested Quantifiers Needed to express statements with multiple variables Example 1: “x+y = y+x for all real numbers”  x  y(x+y = y+x) where the domains.
The Logic of Quantified Statements
CS 285- Discrete Mathematics
Section 1.3. More Logical Equivalences Constructing New Logical Equivalences We can show that two expressions are logically equivalent by developing.
Predicates and Quantifiers
Exam #3 will be given on Monday Nongraded Homework: Now that we are familiar with the universal quantifier, try
Section 1.4: Nested Quantifiers We will now look more closely at how quantifiers can be nested in a proposition and how to interpret more complicated logical.
For Wednesday, read chapter 6, section 1. As nongraded HW, do the problems on p Graded Homework #7 is due on Friday at the beginning of class. In.
CSE115/ENGR160 Discrete Mathematics 01/25/11 Ming-Hsuan Yang UC Merced 1.
Nested Quantifiers Goals: Explain how to work with nested quantifiers
Formal Logic Mathematical Structures for Computer Science Chapter 1 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesFormal Logic.
Lecture # 21 Predicates & Quantifiers
1 Predicates and Quantifiers CS 202, Spring 2007 Epp, Sections 2.1 and 2.2 Aaron Bloomfield.
Predicates and Quantifiers
Chapter 1: The Foundations: Logic and Proofs
The Foundations: Logic and Proofs
Discrete Maths Objective to introduce predicate logic (also called the predicate calculus) , Semester 2, Predicate Logic 1.
MATH 213 A – Discrete Mathematics for Computer Science Dr. (Mr.) Bancroft.
Formal Logic Mathematical Structures for Computer Science Chapter Copyright © 2006 W.H. Freeman & Co.MSCS SlidesFormal Logic.
CS 103 Discrete Structures Lecture 05
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.
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
Chapter 1, Part II With Question/Answer Animations Copyright © McGraw-Hill Education. All rights reserved. No reproduction or distribution without the.
PART TWO PREDICATE LOGIC. Chapter Seven Predicate Logic Symbolization.
Piecewise Graphs A piecewise function is defined by at least two equations, each of which applies to a different part of the function’s domain. One example.
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
Chapter 1: The Foundations: Logic and Proofs 1.1 Propositional Logic 1.2 Propositional Equivalences 1.3 Predicates and Quantifiers 1.4 Nested Quantifiers.
Statements with Multiple Quantifiers. When a statement contains more than one quantifier, we imagine the actions suggested by the quantifiers as being.
Section Predicates & Quantifiers. Open Statement 2 x > 8 p < q -5 x = y + 6 Neither true nor false.
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.
Selected Exercises of Sec. 1.2~Sec.1.4 Sec. 1.2 Exercise 41 p, q, r 중에 두 개가 참이면 참이 되고, 그 외 의 경우에는 거짓이 되는 복합명제를 구하 시오. Find a compound proposition involving.
(CSC 102) Lecture 8 Discrete Structures. Previous Lectures Summary Predicates Set Notation Universal and Existential Statement Translating between formal.
Predicates and Quantified Statements
Nested Quantifiers Section 1.5.
CompSci 102 Discrete Math for Computer Science January 24, 2012 Prof. Rodger Slides modified from Rosen.
Lecture Predicates and Quantifiers 1.4 Nested Quantifiers.
Lecture 7 – Jan 28, Chapter 2 The Logic of Quantified Statements.
Predicates and Quantifiers
321 Section Natalie Linnell. The importance of domains Domain is part of the function definition A predicate is a function from some domain to {T,F} If.
Statements Containing Multiple Quantifiers Lecture 11 Section 2.3 Mon, Feb 5, 2007.
Section 1.5 and 1.6 Predicates and Quantifiers. Vocabulary Predicate Domain Universal Quantifier Existential Quantifier Counterexample Free variable Bound.
Section 1.4. Propositional Functions Propositional functions become propositions (and have truth values) when their variables are each replaced by a value.
Section 1.5. Section Summary Nested Quantifiers Order of Quantifiers Translating from Nested Quantifiers into English Translating Mathematical Statements.
Introduction to Predicates and Quantified Statements I Lecture 9 Section 2.1 Wed, Jan 31, 2007.
Chapter 1, Part II: Predicate Logic With Question/Answer Animations 1.
Uniqueness Quantifier ROI for Quantified Statement.
Lecture 1-3: Quantifiers and Predicates. Variables –A variable is a symbol that stands for an individual in a collection or set. –Example, a variable.
رياضيات متقطعة لعلوم الحاسب MATH 226. Chapter 1 Predicates and Quantifiers 1.4.
CSE15 Discrete Mathematics 01/25/17
The Foundations: Logic and Proofs
Discrete Mathematics.
Nested Quantifiers Goals: Explain how to work with nested quantifiers
The Foundations: Logic and Proofs
The Foundations: Logic and Proofs
Chapter 1 The Foundations: Logic and Proofs
The Foundations: Logic and Proofs
CS201: Data Structures and Discrete Mathematics I
Introduction to Predicates and Quantified Statements II
CS 220: Discrete Structures and their Applications
Xuan Guo Lab 5 Xuan Guo.
Nested Quantifiers Nested quantifiers are often necessary to express the meaning of sentences in English as well as important concepts in computer science.
Introduction to Predicates and Quantified Statements II
Discrete Mathematics Lecture 4 & 5: Predicate and Quantifier
ICS 253: Discrete Structures I
Predicates and Quantifiers
The Foundations: Logic and Proofs
CS201: Data Structures and Discrete Mathematics I
Presentation transcript:

Xuan Guo xguo9@student.gsu.edu Lab 3 Xuan Guo xguo9@student.gsu.edu

Content translate English statement into logical expression using predicates, quantifiers. section 1.4, exercise 25, 41 translate English statement into logical expression using nested quantifiers. section 1.4, exercise 9 Section 1.5, exercise 13

Exercise 25 Translate each of these statements into logical expressions using predicates, quantifiers, and logical connectives. a) No one is perfect. b)Not everyone is perfect. c) All your friends are perfect. d)At least one of your friends is perfect. e) Everyone is your friend and is perfect. f) Not everybody is your friend or someone is not perfect. (Let P(x) be “x is perfect”; let F(x)be “x is your friend”; and let the domain be all people. )

Solution for exercise 25 a) No one is perfect. (Let P(x) be “x is perfect”; let F(x)be “x is your friend”; and let the domain be all people. ) a)∀x¬P(x)

Solution for exercise 25 b)Not everyone is perfect. (Let P(x) be “x is perfect”; let F(x)be “x is your friend”; and let the domain be all people. ) b)¬∀x P(x)

Solution for exercise 25 c) All your friends are perfect. (Let P(x) be “x is perfect”; let F(x)be “x is your friend”; and let the domain be all people. ) c)∀x(F(x)→P(x))

Solution for exercise 25 d)At least one of your friends is perfect. (Let P(x) be “x is perfect”; let F(x)be “x is your friend”; and let the domain be all people. ) d)∃x(F(x)∧P(x))

Solution for exercise 25 e) Everyone is your friend and is perfect. (Let P(x) be “x is perfect”; let F(x)be “x is your friend”; and let the domain be all people. ) e)∀x(F(x)∧P(x))or(∀x F(x))∧(∀x P(x))

Solution for exercise 25 f) Not everybody is your friend or someone is not perfect. (Let P(x) be “x is perfect”; let F(x)be “x is your friend”; and let the domain be all people. ) f)(¬∀x F(x))∨(∃x¬P(x))

Exercise 41 Express each of these system specifications using predicates, quantifiers, and logical connectives. a) At least one mail message, among the nonempty set of messages, can be saved if there is a disk with more than 10 kilobytes of free space. b)Whenever there is an active alert, all queued messages are transmitted. c) The diagnostic monitor tracks the status of all systems except the main console.

Solution for exercise 41 a) At least one mail message, among the nonempty set of messages, can be saved if there is a disk with more than 10 kilobytes of free space. F(x, y)is “Disk x has more than y kilobytes of free space,” and S(x) is “Mail message x can be saved” a)(∃x F(x,10)) →∃z S(z),

Solution for exercise 41 b)Whenever there is an active alert, all queued messages are transmitted. A(x) is “Alert x is active,” Q(x) is “Message x is queued,” and T(x)is “Message x is transmitted” b)(∃x A(x))→∀y(Q(y)→T(y)),

Solution for exercise 41 c) The diagnostic monitor tracks the status of all systems except the main console. T(x) is “The diagnostic monitor tracks the status of system x” c)∀x((x =main console)→T(x)),

Exercise 9 Let P(x) be the statement “x can speak Russian” and let Q(x) be the statement “x knows the computer language C++.” Express each of these sentences in terms of P(x), Q(x), quantifiers, and logical connectives. The domain for quantifiers consists of all students at your school. a) There is a student at your school who can speak Russian and who knows C++. b)There is a student at your school who can speak Russian but who doesn’t know C++. c) Every student at your school either can speak Russian or knows C++. d)No student at your school can speak Russian or knows C++.

Solutions for exercise 9 a)∃x(P(x)∧Q(x)) b)∃x(P(x)∧¬Q(x)) c)∀x(P(x)∨Q(x)) d)∀x¬(P(x)∨Q(x))

Let M(x, y)be “x has sent y an e-mail message” and T (x, y)be “x has telephoned y,” where the domain consists of all students in your class. Use quantifiers to express each of these statements. (Assume that all e-mail messages that were sent are received, which is not the way things often work.) g) There is a student in your class who has sent everyone else in your class an e-mail message. h) There is someone in your class who has either sent an e-mail message or telephoned everyone else in your class. m)There are at least two students in your class such that one student has sent the other e-mail and the second student has telephoned the first student. n) There are two different students in your class who between them have sent an e-mail message to or telephoned everyone else in the class.

Solution for exercise 13 g) There is a student in your class who has sent everyone else in your class an e-mail message. M(x, y) is “x has sent y an e-mail message” and T (x, y) is “x has telephoned y,” g)∃x∀y(y =x→M(x, y))

Solution for exercise 13 h) There is someone in your class who has either sent an e-mail message or telephoned everyone else in your class. M(x, y) is “x has sent y an e-mail message” and T (x, y) is “x has telephoned y,” h)∃x∀y(y =x →(M(x, y)∨T (x, y)))

Solution for exercise 13 m)There are at least two students in your class such that one student has sent the other e-mail and the second student has telephoned the first student. M(x, y) is “x has sent y an e-mail message” and T (x, y) is “x has telephoned y,” m)∃x∃y(x =y∧M(x, y)∧T (y, x))

Solution for exercise 13 n) There are two different students in your class who between them have sent an e-mail message to or telephoned everyone else in the class. M(x, y) is “x has sent y an e-mail message” and T (x, y) is “x has telephoned y,” n)∃x∃y(x =y∧ ∀z((z =x∧z =y)→(M (x, z) ∨M(y,z)∨T(x,z)∨ T (y, z))))