Definition of set using elementhood test

AI Thread Summary
The discussion revolves around defining the set A = {1, 4, 9, 16, 25, 36, 49,...} using elementhood tests. One proposed definition is A = { x ∈ ℵ^{+} | x^{2} }, which is deemed correct, while another definition, A = { x ∈ ℕ^{+} | y is a positive odd integer, x + y }, raises concerns about its accuracy due to cases where x + y does not yield an element of A. The distinction between bound and free variables is highlighted, noting that y is a free variable, allowing for some values to satisfy the condition while others do not. This leads to the conclusion that the two definitions cannot be equal since they do not contain the same elements. The discussion emphasizes the importance of ensuring definitions work universally for all cases.
el_llavero
Messages
29
Reaction score
0
I have a set, A = {1,4,9,16,25,36,49,...}, that I want to write a definition for using an elementhood test. I have written one defintion I'm sure is correct but I'm not sure if the other one is appropriate since there are values that satisfy the conditions in the definitions but produce values that are not elements of A.

I have A = { x \in \aleph ^{+} | x ^{2} }

However I've seen another definition for the same set but I'm not sure it's accurate

A = { x ∈ ℕ ^{+} | y is a positive odd integer, x + y }

I'm not sure the second defition is correct, take the case where x is 1 and y is 5, then x+y=6, which is not part of the set. Could someone give me their perspective. I'm under the impression that these definitions have to work in all cases.
 
Physics news on Phys.org
"I'm not sure the second defition is correct, take the case where x is 1 and y is 5, then x+y=6, which is not on the list. Could someone give me their perspective. "

Haven't you answered your own question about the correctness of the second "definition"?
 
My question is more about the structure of the second expression used to define the set A.

I've just read something regarding free variables and bound variables. In the case of the second definition, x is a bound variable since the notation {x |...} binds the variable and y is a free variable since you can plug in different values for y, and it's not bound by said notation . Since y is a free variable the statement will be true for some values of y and false for others therefor the second expression is accurate. plugging some values for y will produce an element in the set while others won't but that's ok since y is not a bound variable.

Am I making sense? I going by definitions in this book I'm using.
 
I don't know all the relevant definitions and theorems, but since the two sets you described do not contain the same elements, how can they be equal?
 
how do you know they don't contain the same elements, y isn't bound so it can stand for all the values that make x+y an element of the original set.
 
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...
Back
Top