1.4 NESTED QUANTIFIERS, Study notes of Elementary Mathematics

Section 1.4 Nested Quantifiers. 1.4.3. OPTIONAL CLASSROOM EXERCISE. An exercise about varying the subdomain from within the set of all people.

Typology: Study notes

2021/2022

Uploaded on 09/07/2022

nabeel_kk
nabeel_kk 🇸🇦

4.6

(65)

1.3K documents

1 / 3

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Section 1.4 Nested Quantifiers 1.4.1
1.4 NESTED QUANTIFIERS
Example 1.4.1: Every sophomore owns a
computer or has a friend in the junior class who
owns a computer.
Domains Sand Jare the sophomores and the
juniors. Predicates C(u) and F(v, w) mean that
uowns a computer and that wis a friend of v.
(xS)C(x)(yJ)[F(x, y)C(y)].
disambiguation: Specify the domain when not
evident from context. Use brackets to identify
scope of quantifiers.
TRANSPOSING QUANTIFIERS
Be careful about transposing different kinds of
quantifiers.
(x)(y)[x2y] is true.
(y)(x)[x2y] is false.
However, you can safely transpose two quantifiers
of the same kind.
Coursenotes by Prof. Jonathan L. Gross for use with Rosen: Discrete Math and Its Applic., 5th Ed.
pf3

Partial preview of the text

Download 1.4 NESTED QUANTIFIERS and more Study notes Elementary Mathematics in PDF only on Docsity!

Section 1.4 Nested Quantifiers 1.4.

1.4 NESTED QUANTIFIERS

Example 1.4.1: Every sophomore owns a computer or has a friend in the junior class who owns a computer. Domains S and J are the sophomores and the juniors. Predicates C(u) and F (v, w) mean that u owns a computer and that w is a friend of v. (∀x ∈ S)[C(x) ∨ (∃y ∈ J)[F (x, y) ∧ C(y)]]. disambiguation: Specify the domain when not evident from context. Use brackets to identify scope of quantifiers.

TRANSPOSING QUANTIFIERS Be careful about transposing different kinds of quantifiers. (∀x)(∃y)[x^2 ≤ y] is true. (∃y)(∀x)[x^2 ≤ y] is false. However, you can safely transpose two quantifiers of the same kind.

Chapter 1 FOUNDATIONS 1.4.

RECALL NEGATION with QUANTIFIERS p: There exists some input data for which this program will crash. ¬p: No matter what input data you supply to this program, it will not crash. Rule 1: ¬(∃x)[P (x)] ⇔ (∀x)[¬P (x)] Rule 2: ¬(∀x)[P (x)] ⇔ (∃x)[¬P (x)]

CLASSROOM EXERCISE Write the negation of this statement (∀x)(∃y)[x^2 ≤ y] so that no negation (¬) appears to the left of a quantifier. ¬(∀x)(∃y)[x^2 ≤ y] =