Scribd
Upload
87 views4 pages

NSU CSE173 Discrete Mathematics Solution.

The document contains examples of logical expressions using quantifiers and predicates. It defines common predicates used in the examples such as P(x) meaning "x is in the correct place" and provides the negations of various logical expressions by changing quantifiers from universal to existential and vice versa. It also discusses representing the same meaning using one or two variable predicates and varying the domains.

Uploaded by

Quddus
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
87 views4 pages

NSU CSE173 Discrete Mathematics Solution.

The document contains examples of logical expressions using quantifiers and predicates. It defines common predicates used in the examples such as P(x) meaning "x is in the correct place" and provides the negations of various logical expressions by changing quantifiers from universal to existential and vice versa. It also discusses representing the same meaning using one or two variable predicates and varying the domains.

Uploaded by

Quddus
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

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))

18.

a) ∃xP(x): P(-2) ∨ P(-1) ∨ P(0) ∨ P(1) ∨ P(2)

b) ∀xP(x): P(-2) ∧ P(-1) ∧ P(0) ∧ P(1) ∧ P(2)

c) ∃x¬P(x): ¬P(-2) ∨ ¬P(-1) ∨ ¬P(0) ∨ ¬P(1) ∨ ¬P(2)

d) ∀x¬P(x): ¬P(-2) ∧ ¬P(-1) ∧ ¬P(0) ∧ ¬P(1) ∧ ¬P(2)

e) ¬∃xP(x): ¬(P(-2) ∨ P(-1) ∨ P(0) ∨ P(1) ∨ P(2))

f) ¬∀xP(x): ¬(P(-2) ∧ P(-1) ∧ P(0) ∧ P(1) ∧ P(2))

23.

a) ∃xH(x) states "There exists someone who can speak Hindi."


∃x(C(x) ∧ H(x)) states "There exists someone in your class who can speak Hindi."

b) ∀xF(x) states "Everyone is friendly."


∀x(C(x) → F(x)) states "Everyone in your class is friendly."

c) ∃x¬B(x) states "There exists someone who was not born in California."
∃x(C(x) ∧ ¬B(x)) states "There exists someone in your class who was not born in California."

d) ∃xM(x) states "There exists someone who has been in a movie."


∃x(C(x) ∧ M(x)) states "There exists someone in your class who has been in a movie."

e) ∀x¬L(x) states "Everyone has not taken a course in logic programming."


∀x(C(x) → ¬L(x)) states "Everyone in your class has not taken a course in logic programming."

26.

a) Someone in your school has visited Uzbekistan.


i. Using predicates with one variable:
- Domain: People in your school
- Predicate: V(x): x has visited Uzbekistan
- Logical expression: ∃x V(x)

ii. Using predicates with two variables:


- Domain: People in your school, Places
- Predicate: V(x, y): Person x has visited place y
- Logical expression: ∃x ∃y (x is in your school ∧ y = Uzbekistan ∧ V(x, y))

iii. Varying the domain:


- Domain: People in the world, Schools
- Predicate: S(x): x is in your school
- Logical expression: ∃x (S(x) ∧ V(x, Uzbekistan))

b) Everyone in your class has studied calculus and C++.


i. Using predicates with one variable:
- Domain: People in your class
- Predicates: C(x): x has studied calculus, P(x): x has studied C++
- Logical expression: ∀x (C(x) ∧ P(x))

ii. Using predicates with two variables:


- Domain: People in your class, Subjects
- Predicate: S(x, y): Person x has studied subject y
- Logical expression: ∀x (S(x, calculus) ∧ S(x, C++))

iii. Varying the domain:


- Domain: People in the world, Classes
- Predicate: C(x): x is in your class
- Logical expression: ∀x (C(x) → (C(x) ∧ P(x)))

c) No one in your school owns both a bicycle and a motorcycle.


i. Using predicates with one variable:
- Domain: People in your school
- Predicates: B(x): x owns a bicycle, M(x): x owns a motorcycle
- Logical expression: ¬∃x (B(x) ∧ M(x))

ii. Using predicates with two variables:


- Domain: People in your school, Items
- Predicate: O(x, y): Person x owns item y
- Logical expression: ¬∃x ∃y (x is in your school ∧ y = bicycle ∧ z = motorcycle ∧ O(x, y) ∧ O(x, z))

iii. Varying the domain:


- Domain: People in the world, Schools, Items
- Predicate: S(x): x is in your school
- Logical expression: ¬∃x (S(x) ∧ O(x, bicycle) ∧ O(x, motorcycle))

d) There is a person in your school who is not happy.


i. Using predicates with one variable:
- Domain: People in your school
- Predicate: H(x): x is happy
- Logical expression: ∃x ¬H(x)

ii. Using predicates with two variables:


- Domain: People in your school, Emotions
- Predicate: E(x, y): Person x has emotion y
- Logical expression: ∃x (E(x, school) ∧ ¬E(x, happy))

iii. Varying the domain:


- Domain: People in the world, Schools, Emotions
- Predicate: S(x): x is in your school
- Logical expression: ∃x (S(x) ∧ ¬E(x, happy))
e) Everyone in your school was born in the twentieth century.
i. Using predicates with one variable:
- Domain: People in your school
- Predicate: B(x): x was born in the twentieth century
- Logical expression: ∀x B(x)

ii. Using predicates with two variables:


- Domain: People in your school, Centuries
- Predicate: B(x, y): Person x was born in century y
- Logical expression: ∀x (B(x, twentieth))

iii. Varying the domain:


- Domain: People in the world, Schools, Centuries
- Predicate: S(x): x is in your school
- Logical expression: ∀x (S(x) → B(x, twentieth))

28.
a)¬P(x)
b) ∀x(T(x)→(P(x)∧C(x)))
c) ∀x(T(x)→(P(x)∧C(x)))
d)¬∃x(P(x)∧C(x))
e)∃x(T(x)∧¬P(x)∧C(x))

In these expressions:
- T(x) means "x is a tool",
- P(x) means "x is in the correct place"
- C(x) means "x is in excellent condition".

33.
a) Domain: Old dogs.
∃x T (x)
Negation is ∀x ¬T (x): No old dogs can
learn new tricks.

b) Domain: Rabbits.
¬∃x C(x)
Negation is ∃x C(x): There is a rabbit that knows calculus.

c) Domain: Birds.
∀x B (x)
Negation is ∃x ¬B (x): There is a bird who cannot fly.

d) Domain: Dogs.
¬∃x D (x)
Negation is ∃x D (x): There is a dog that talks.

e) Domain: People in this class.


¬∃x(F (x)∧R(x))
Negation is ∃x(F (x)∧R(x)): There is someone in this class who knows French and Russian.
In these expressions:
T(x) means "x can learn new tricks"
C(x) means "x knows calculus"
B (x) means "x can fly"
D (x) means "x can talk"
F(x) means "x knows French"
R(x) means "x Russian"

34.
a) Negation: ¬(∃x)(D(x) ∧ ¬S(x)): There are no drivers who do not obey the speed limit.

b) Negation: ¬(∀x)(S(x) → M(x)): There exists a Swedish movie that is not serious.

c) Negation: ¬(∀x)(P(x) → K(x)): There exists someone who can't keep a secret.

d) Negation: ¬(∃x)(C(x) ∧ ¬G(x)): Everyone in this class has a good attitude.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy