MHB Solve Logic Puzzle: Predicates & True/False Explained

  • Thread starter Thread starter Plonker1
  • Start date Start date
  • Tags Tags
    Logic
Plonker1
Messages
3
Reaction score
0
View attachment 6460

I'm unsure about these three, here are my attempts. Please also explain the difference between a predicate and true/false. I assumed it is a predicate when it can be either true or false.

a) Predicate. Negation is ¬(∃n ∈ N n²>n)
b) True. Negation is, "When x<0 there is y such that y^2=x
c) No clue :P

Your help is truly appreciated!
 

Attachments

  • 0dba70db4045aeae0a7b654b41405ef5.png
    0dba70db4045aeae0a7b654b41405ef5.png
    12.5 KB · Views: 94
Physics news on Phys.org
I assume by predicate, it is meant that the sentence has unbound variables. So

a) This is a statement. The negation is
$$\exists n \text{ such that }n\in N \text{ and }n^2\leq n$$
The negation is true (set n=1) and so the original statement is false.

b) The variable x is not bound, so this is a predicate. To make a statement one might say:
$$\forall x \in R\text{ if }x<0 \text{ then }\not\exists y\in R \text{ such that }y^2=x$$
I leave it to you to negate this statement.

c) This is a true statement. ("famous" theorem of Fermat says a prime is the sum of two squares iff the prime is congruent to 1 mod 4)
The negation is:
$$\exists p\in P \text{ such that }\exists n\in N \text{ with }p=4n+1\text{ and }\forall a\in N\,\forall b\in N\,a^2+b^2\neq p$$
 
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

Back
Top