Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » sci.math.* » sci.math

Topic: SET THEORY and QUANTIFIER LOGIC are SUPERFLUOUS! You only need
1 or the other!

Replies: 8   Last Post: Nov 22, 2012 4:20 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Dan Christensen

Posts: 2,877
Registered: 7/9/08
Re: SET THEORY and QUANTIFIER LOGIC are SUPERFLUOUS! You only need 1
or the other!

Posted: Nov 22, 2012 2:39 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

On Nov 20, 4:09 am, Graham Cooper <grahamcoop...@gmail.com> wrote:
> The notation in
>
> { x | p(x) }
>
> stands for ALL VALUES OF x
> that are satisfied in p(x)
>
> This is the SAME 'ALL' as   ALL(x) ....predicate(..predicate...
> x  ...) ...)
>
> ALL is merely SUBSET!
>
> ALL(n):N  n+1 > n
>
> is just
>
> { n | neN }  C  { n | n+1>n }
>
>


How do you propose to do proof by induction e.g. prove 1+2+3+...+n =
n(n+1)/2?

Dan
Download my DC Proof 2.0 software at http://www.dcproof.com



Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.