Transforming predicate form to quantifiers

  • Thread starter Thread starter MarcL
  • Start date Start date
  • Tags Tags
    Form
Click For Summary
The discussion focuses on converting a mathematical statement into predicate form using logical operators and quantifiers. The specific statement to be transformed is that for any positive integers x and y, there exists a positive integer z such that the equation x² + y² - z = 0 holds true. The user initially attempted to express this as ∀x∀y (x² + y² = z), but recognized this was incorrect. The correct interpretation involves using the existential quantifier to indicate the existence of z, leading to the formulation ∀x∀y∃z (x² + y² = z). The conversation emphasizes understanding the distinction between universal and existential quantifiers in mathematical logic.
MarcL
Messages
170
Reaction score
2

Homework Statement


Write the following statements in predicate form, using logical operators ^,∨, (NOT - negation but don't know where the symbol is :/) , and quantifiers ∀,∃. Below ℤ+ denotes all positive integers {1,2,3,...}.

I need help with this first statement:
For any x, y ∈ ℤ+ the equation x2 + y2 - z = 0 has a solution z
∈ ℤ+

Homework Equations


The fact that ∀ is universal and ∃ is existential.

The Attempt at a Solution



I can't seem to figure out where to start... I just got ∀x∀y ( x2 + y2 = z) which seems wrong to me. any help?
 
Physics news on Phys.org
"Has a solution" means "there exists a solution".
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 7 ·
Replies
7
Views
2K
Replies
4
Views
2K
  • · Replies 14 ·
Replies
14
Views
4K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 11 ·
Replies
11
Views
6K
  • · Replies 17 ·
Replies
17
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K