Results 1 to 2 of 2

Math Help - Logic/disjunction proof

  1. #1
    Newbie
    Joined
    Aug 2011
    Posts
    18

    Logic/disjunction proof

    Prove ∃x(P(x) → ∀y(P(y))).


    Obviously, we have that ∃x(P(x) → ∀y(P(y))) is equivalent to ∃x(P(x) ∨ ∀y(P(y))).

    This exercise is found in a section on "proofs involving disjunctions." I have tried many different ways to solve this and have a feeling I am not approaching it the right way (why I"m not including any attempts above). Perhaps I am not considering clever enough exhaustive cases? Can anyone direct me in the proper way to begin?
    Follow Math Help Forum on Facebook and Google+

  2. #2
    MHF Contributor
    Joined
    Oct 2009
    Posts
    5,540
    Thanks
    780

    Re: Logic/disjunction proof

    This is the so-called drinker paradox: there is someone in the pub such that, if he is drinking, everyone in the pub is drinking. Its proof essentially uses the law of excluded middle or double-negation elimination.

    Do you need a formal proof? If so, which proof system you are using?
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Standard symbol for exclusive disjunction?
    Posted in the Discrete Math Forum
    Replies: 3
    Last Post: June 1st 2011, 01:46 PM
  2. Conjunction Disjunction confuse.
    Posted in the Discrete Math Forum
    Replies: 5
    Last Post: February 1st 2010, 11:19 AM
  3. Logic Proof
    Posted in the Algebra Forum
    Replies: 2
    Last Post: March 26th 2008, 02:24 PM
  4. Conjunction, Disjunction
    Posted in the Math Topics Forum
    Replies: 1
    Last Post: September 27th 2007, 09:18 AM
  5. disjunction question
    Posted in the Discrete Math Forum
    Replies: 4
    Last Post: June 29th 2007, 12:07 PM

Search Tags


/mathhelpforum @mathhelpforum