in Mathematical Logic edited by
2,928 views
0 votes
0 votes

Express the statement "Everyone has exactly one best friend" as a logical expression involving predicates,quantifiers with a domain consisting of all people,and logical connectives without using uniqueness quantifier.

I am confused pleased explain it

in Mathematical Logic edited by
by
2.9k views

3 Answers

5 votes
5 votes
Best answer

Everyone has exactly one best friend.

Let me define few predicates before proceeding to the answer :

$F(x,y)$ = $y$ is a Best friend of $x$. And let the domain be All People in the world.

(Assuming that No one is a best friend of himself/herself. (i.e. $F(x,x)$ is False) )

$\forall x (\exists y F(x,y) \wedge \forall z ((z \neq y) \rightarrow \sim F(x,z)))$

Interpretation : For every person $x$ there is some person $y$ who is best friend of $x$ And for any(every) person $z$, if $z$ is not same person as $y$ then $z$ is Not a best friend of $x$.


Refer here for clarity about Uniqueness Quantifier/Quantification : https://gateoverflow.in/219473/kenneth-rosen-ch-1-ex-1-5-qn-52?show=219480#a219480

selected by
0 votes
0 votes
Instead of including a new variable z we can also express the statement as $\forall x\exists !yB(x,y)$  where $\exists! $ is the "uniqueness quantifier".
–1 vote
–1 vote

people =p(x)

best friend=b(y)

∀x(p(x)⟶∃y(b(y)))

1 comment

If $b(x,y)$ means $y$ is a best friend of $x$ and If the domain is taken to be All the people in the world then the expression ∀x(p(x)⟶∃y(b(x,y)))

For every person $x$, there is at least one person who is best friend of $x$.

It does not say "One and Only One".
0
0

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true