Selected Exercises of Sec. 1.2~Sec.1.4 Sec. 1.2 Exercise 41 p, q, r 중에 두 개가 참이면 참이 되고, 그 외 의 경우에는 거짓이 되는 복합명제를 구하 시오. Find a compound proposition involving.

Slides:



Advertisements
Similar presentations
Propositional Equivalences
Advertisements

Nested Quantifiers Section 1.4.
The Logic of Quantified Statements
Section 1.3. More Logical Equivalences Constructing New Logical Equivalences We can show that two expressions are logically equivalent by developing.
Chapter 1: The Foundations: Logic and Proofs 1.1 Propositional Logic 1.2 Propositional Equivalences 1.3 Predicates and Quantifiers 1.4 Nested Quantifiers.
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Sixth Edition, Mc Graw-Hill, 2007 Chapter 1: (Part 2): The Foundations: Logic and Proofs.
L41 Lecture 2: Predicates and Quantifiers.. L42 Agenda Predicates and Quantifiers –Existential Quantifier  –Universal Quantifier 
CS128 – Discrete Mathematics for Computer Science
Computability and Complexity 8-1 Computability and Complexity Andrei Bulatov Logic Reminder.
Propositional Logic. Negation Given a proposition p, negation of p is the ‘not’ of p.
Discrete Mathematics Math 6A Instructor: M. Welling.
CSE115/ENGR160 Discrete Mathematics 01/25/11 Ming-Hsuan Yang UC Merced 1.
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.
Lecture # 21 Predicates & Quantifiers
Predicates and Quantifiers
Chapter 1: The Foundations: Logic and Proofs
Discrete Mathematics Goals of a Discrete Mathematics Learn how to think mathematically 1. Mathematical Reasoning Foundation for discussions of methods.
The Foundations: Logic and Proofs
Propositions and Truth Tables
CSCI 115 Chapter 2 Logic. CSCI 115 §2.1 Propositions and Logical Operations.
MATH 213 A – Discrete Mathematics for Computer Science Dr. (Mr.) Bancroft.
Mathematical Structures A collection of objects with operations defined on them and the accompanying properties form a mathematical structure or system.
CS 173, Lecture B September 1, 2015 Tandy Warnow.
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.
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.
Lecture Propositional Equivalences. Compound Propositions Compound propositions are made by combining existing propositions using logical operators.
Section Predicates & Quantifiers. Open Statement 2 x > 8 p < q -5 x = y + 6 Neither true nor false.
January 30, 2002Applied Discrete Mathematics Week 1: Logic and Sets 1 Let’s Talk About Logic Logic is a system based on propositions.Logic is a system.
Sets and Sentences Open Sentences Foundations of Real Analysis.
CS100 : Discrete Structures
Predicates and Quantified Statements
Nested Quantifiers Section 1.5.
Thinking Mathematically
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.
Chapter 1: The Foundations: Logic and Proofs
CSNB143 – Discrete Structure Topic 4 – Logic. Learning Outcomes Students should be able to define statement. Students should be able to identify connectives.
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.
 To combine propositions using connectives  To construct the truth table of a given compound proposition  To define de Morgan Law for logic  To define.
Thinking Mathematically Logic 3.4 Truth Tables for the Conditional and Biconditional.
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 Discrete Mathematics Discrete Mathematics: is the part of mathematics devoted to the study of discrete objects. Discrete Mathematics is.
 Conjunctive Normal Form: A logic form must satisfy one of the following conditions 1) It must be a single variable (A) 2) It must be the negation of.
رياضيات متقطعة لعلوم الحاسب MATH 226. Chapter 1 Predicates and Quantifiers 1.4.
Chapter 1 Propositional Logic
Presented by: Tutorial Services The Math Center
CSE15 Discrete Mathematics 01/25/17
The Foundations: Logic and Proofs
CSE15 Discrete Mathematics 01/23/17
DISCRETE MATHEMATICS CHAPTER I.
Truth Tables and Equivalent Statements
Chapter 1 – Logic and Proof
Discrete Mathematics Lecture # 2.
CMSC Discrete Structures
The Foundations: Logic and Proofs
Propositional Equivalences
Propositional Equivalences
Nested Quantifiers Nested quantifiers are often necessary to express the meaning of sentences in English as well as important concepts in computer science.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Discrete Mathematics Lecture 2: Propositional Logic
Discrete Mathematics Lecture 2: Propositional Logic
Statements of Symbolic Logic
Predicates and Quantifiers
1.2 Propositional Equivalences
1.3 Propositional Equivalences
Propositional Satisfiability
Presentation transcript:

Selected Exercises of Sec. 1.2~Sec.1.4

Sec. 1.2 Exercise 41 p, q, r 중에 두 개가 참이면 참이 되고, 그 외 의 경우에는 거짓이 되는 복합명제를 구하 시오. Find a compound proposition involving the propositional variable p, q, and r that is true when exactly two of p, q, and r are true and is false otherwise. Solution: (p  q   r)  (p   q  r)  (  p  q  r).

Sec. 1.2 Exercise 55 How many different truth tables of compound propositions are there that involve the propositional variables p and q? Solution:16

Sec. 1.3 Exercise 7 Translate these statements into English, where C(x) is “x is a comedian” and F(x) is “x is funny” and the domain consists of all people. a)  x (C(x)  F(x)) Every comedian is funny. b)  x (C(x)  F(x)) Every person is a funny comedian.

Cont. c)  x (C(x)  F(x)) There exists a person such that if she or he is a comedian, then she or he is funny. d)  x (C(x)  F(x)) Some comedians are funny.

Sec. 1.3 Exercise 29 Express each of these statements using logical operators, predicates, and quantifiers. Solution: Let T(x) mean that x is a tautology and C(x) mean that x is a contradiction. a) Some propositions are tautologies. :  x T(x) b) The negation of a contradiction is a tautology  x (C(x)  T(  x))

Cont. c) The disjunction of two contingencies can be a tautology.  x  y(  T(x)   C(x)   T(y)   C(y)  T(x  y)) c) The conjunction of two tautologies is a tautology.  x  y (T(x)  T(y)  T(x  y))

Sec. 1.4 Exercise 1 Translate these statements into English, where the domain for each variable consists of all real number. a)  x  y(x < y) For every real number x there exists a real number y such that x is less than y.

Cont. b)  x  y(((x ≥ 0)  (y ≥ 0))  xy ≥ 0)) For every real number x and real number y, if x and y are both nonnegative, then their product is nonnegative. c)  x  y  z (xy = z) For every real number x and real number y, there exists a real number z such that xy = z.

Sec. 1.4 Exercise 11 Let S(x) be the predicate “x is a student,” F(x) the predicate “x is faculty member,” and A(x, y) the predicate “x has asked y a question,” where the domain consists of all people associated with your school. Use quantifiers to express each of these statements. a) Lois has asked Professor Michaels a question. => A(Lois, Professor Michaels)

Cont. b) Every student has asked Professor Gross a question. =>  x(S(x)  A(x, Professor Gross) c) Every faculty member has either asked Professor Miller a question or been asked a question by Professor Miller. =>  x(F(x)  (A(x, Professor Miller)  A(Professor Miller, x)

Cont. d) Some student has not asked any faculty member a question. =>  x(S(x)   y(F(y)   A(x, y))) e) There is a faculty member who has never been asked a question by a student. =>  x(F(x)   y(S(y)   A(y, x)))

Cont. f) Some student has asked every faculty member a question. =>  y(F(y)   x(S(x)  A(y, x))) g) There is a faculty member who has asked every other faculty member a question. =>  x(F(x)   y((F(y)  (y≠ x))  A(x, y)))

Cont. h) Some student has never been asked a question by a faculty member. =>  x(S(x)   y(F(y)   A(y, x)))