How to Symbolize Quantifiers and Predicates in Logic Problems

  • Thread starter Thread starter nicnicman
  • Start date Start date
AI Thread Summary
The discussion focuses on how to symbolize the statement "For all integers n, 2n+1 is an odd integer" using quantifiers and predicates. One participant suggests using the predicate O(x) to denote that x is odd, proposing the expression ∀xO(2x + 1). Another member offers a more detailed formulation, stating that the correct expression is ∀x∀y((y=2x + 1) → O(y)), clarifying the relationship between n and the resulting odd integer. The conversation emphasizes the importance of accurately defining the domain and predicates in logical expressions. Overall, the participants aim to refine their understanding of symbolizing logical statements in mathematics.
nicnicman
Messages
132
Reaction score
0

Homework Statement


For a homework assignment I got the following as a question:

Symbolize the following using quantifiers, predicates and logical connectives.

For all integers n, 2n+1 is an odd integer.


Homework Equations





The Attempt at a Solution



O(x): x is odd
domain for x is all integers
∀xO(2x + 1)

Would this be correct?
 
Physics news on Phys.org
I got an answer for this from another member of the forum

Domain for x is all integers
O(x): x is odd
∀x∀y((y=2x + 1) → O(y))
 
Back
Top