First Order (formal) Logic Question

Discuss the merits and deficiencies of political theories and philosophical questions.

Announcements Posted on
Sign in to Reply
  1. NYU2012's Avatar
    • Overlord in Training
    • Location: New York University '12 --> Durham Law '15
    • Posts: 2,866
    First Order (formal) Logic Question
    Logic professor wrote on the board today:

    -Ax Ey Loves (y, x)

    So, two questions:

    (1) Is the negation operating on the entire statement, or only the universal quantifier? She said that she was 95% sure that convention has it that the negation will operate on the entire statement and not just the universal quantifier?

    (2) Supposing that the negation is operating only on the universal, is this read as:

    It is not the case that for every x there exists some y such that y loves x?

    Simplified:

    There exists some x such that there exists some y, such that y loves x?

    I have no idea how it would be translated if the negation operated on the entire statement?

    It is not the case that it is the case that for every x there exists some y, such that y loves x?
    Last edited by NYU2012; 02-05-2012 at 19:26.
  2. NYU2012's Avatar
    • Overlord in Training
    • Location: New York University '12 --> Durham Law '15
    • Posts: 2,866
    Re: First Order (formal) Logic Question
    (Original post by Darkphilosopher)
    Sorry but that made absolutely no sense what so ever.
    What part of it didn't make sense?
    Last edited by NYU2012; 02-05-2012 at 23:52.
  3. Aesop's Avatar
    • Peer Of The TSR Realm
    • Location: England
    Re: First Order (formal) Logic Question
    The negation covers the quantifier and the statement quantified over, so that it would read: it is not the case that for all x there is some y such that y loves x.

    You can't negate a quantifier by itself ... it's always quantifying over something ...
  4. mmmpie's Avatar
    • Vengeful, Imperial Overlord of The Student Room
    • Location: Reading
    • Posts: 4,232
    Re: First Order (formal) Logic Question
    I would read that as negating the quantifier.

    So you get either

    it is the case that (for not all x (there exists some y such that (y loves x))

    or

    it is not the case that (for all x (there exists some y such that (y loves x))


    I think these are actually equivalent - if somebody proved in the distant past that they're equivalent for all predicates that would explain the ambiguous notation.
Sign in to Reply
Share this discussion:  
Useful resources
Article updates
Moderators

We have a brilliant team of more than 60 volunteers looking after discussions on The Student Room, helping to make it a fun, safe and useful place to hang out.

Reputation gems:
The Reputation gems seen here indicate how well reputed the user is, red gem indicate negative reputation and green indicates a good rep.
Post rating score:
These scores show if a post has been positively or negatively rated by our members.