Logical expression using quantifiers

  • Thread starter mutzy188
  • Start date
  • Tags
    Expression
In summary, the conversation is about expressing a statement as a logical expression using quantifiers and stating the universe of discourse. There is a disagreement about the correct expression, with the original post suggesting (∃y)((∀x)(y<x) )x and the second poster suggesting \forall x > 0,\;\exists y > 0:y < x. The second poster clarifies that the original post's expression suggests there is a smallest positive number, while the correct expression should take the negation of that.
  • #1
mutzy188
37
0

Homework Statement



Express each statement as a logical expression using quantifiers. State the universe of discourse.:

There is no smallest positive real number

The Attempt at a Solution



(∃y)((∀x)(y<x) )x

universe of discourse: poaitive real numbers

Is this correct?

Thanks
 
Physics news on Phys.org
  • #2
Why not just write: [tex]\forall x > 0,\;\exists y > 0:y < x[/tex]
 
Last edited:
  • #3
Your statement says that there is a smallest positive number. You want to take the negation of that.
 
  • #4
ZioX said:
Your statement says that there is a smallest positive number
No, my statement does not say that at all.

*Edit: If your post was directed at the OP, please state so in your post; else, your assertion is clearly false (your post comes directly after mine, so I assume you are referring to my post)
 
Last edited:
  • #5
It is quite possible that ZioX wrote his reply before yours was posted- he thought his would appear immediately after mutzy188's post. Of course, you are right. It would have been clearer if he (and you- your reply might well have wound up after his) had copied the original post into the response.
 

FAQ: Logical expression using quantifiers

What is a quantifier in a logical expression?

A quantifier is a symbol that specifies the scope of a variable in a logical expression. It tells us whether a statement applies to all or some elements in a given set.

How do you represent "for all" and "there exists" in logical expressions?

The symbol ∀ (for all) is used to represent universal quantification, which means that a statement applies to all elements in a set. The symbol ∃ (there exists) is used to represent existential quantification, which means that a statement applies to at least one element in a set.

How do you negate logical expressions with quantifiers?

To negate a logical expression with a quantifier, we use De Morgan's laws. For example, the negation of "for all x, P(x)" would be "there exists x such that not P(x)". Similarly, the negation of "there exists x, P(x)" would be "for all x, not P(x)".

Can you give an example of a logical expression using quantifiers?

One example of a logical expression using quantifiers is "∀x, x>0 → ∃y, y>x". This translates to "for all x, if x is greater than 0, then there exists a y that is greater than x".

How are quantifiers used in mathematics and computer science?

In mathematics, quantifiers are used to define the properties of sets and to make statements about them. In computer science, they are used to express conditions and specify the behavior of algorithms and programs.

Similar threads

Replies
2
Views
1K
Replies
1
Views
2K
Replies
3
Views
1K
Replies
7
Views
1K
Replies
3
Views
2K
Replies
2
Views
2K
Replies
9
Views
2K
Back
Top