Predicate calculus and use of the form there exists exactly one

  • Thread starter Thread starter Exogenist
  • Start date Start date
  • Tags Tags
    Calculus Form
Exogenist
Messages
2
Reaction score
0
Predicate calculus and use of the form "there exists exactly one"

Given the following utterance does the analysis necessarily follow. Is there something wrong with it or would it be deemed a correct analysis.

“Everyone has exactly one best friend”

∀x( if x is a person then there exists exactly one y such that x has a best friend y)
F(x, y) = “x has a best friend y” Pe(x) = “x is a person”
∀x(Pe(x) → ∃!y(F(x, y))
∀x(Pe(x) → ∃y(F(x, y) & ~∃z((y ≠ z) & F(x, z))
∀x(Pe(x) → ∃y(F(x, y) & ∀z((y = z) v ~F(x, z))
∀x(Pe(x) → ∃y(F(x, y) & ∀z((y = z) v ~F(x, z))
∀x(Pe(x) → ∃y(F(x, y) & ∀z((y ≠ z) → ~F(x, z)) = “Everyone has exactly one best friend”
 
Physics news on Phys.org


Exogenist said:
would it be deemed a correct analysis.

What do you mean by "analysis"? Is what you gave supposed to be a series of steps, each following from the other? Or is it a collection of possible answers, each one to be marked correct or incorrect?
 


Stephen Tashi said:
What do you mean by "analysis"? Is what you gave supposed to be a series of steps, each following from the other? Or is it a collection of possible answers, each one to be marked correct or incorrect?

Yes its supposed to be a series of steps. By analysis I mean is the following formula ∀x(Pe(x) → ∃y(F(x, y) & ∀z((y ≠ z) → ~F(x, z)) where F(x, y) = “x has a best friend y” and Pe(x) = “x is a person”, equivalent to saying "everyone has exactly one best friend".
 


Whether its a correct analysis will depend on whether you can justify the steps using whatever assumptions or theorems that your course materials employ. Different textbooks may use different axioms and theorems, so I can't evaluate whether your analysis is correct.

I do agree that each individual step is equivalent to statement you began with (assuming that \exists ! is defined the way that let's to go from step 1 to step 2).
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.

Similar threads

Replies
6
Views
2K
Replies
30
Views
4K
Replies
3
Views
2K
Replies
3
Views
2K
Replies
5
Views
2K
Replies
8
Views
243
Replies
3
Views
2K
Replies
4
Views
3K
Back
Top