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 ]
Graham Cooper

Posts: 4,334
Registered: 5/20/10
SET THEORY and QUANTIFIER LOGIC are SUPERFLUOUS! You only need
1 or the other!

Posted: Nov 20, 2012 4:09 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

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 }


----------------------

ALL(x):N xeR

is just

{ x | xeN } C { x | xeR }

Naturals are a subset of Reals!

All Naturals are elements of Reals!
A(x):N xeR

--------------------

This is good news for me since I'm adding breadth first functionality
to microPROLOG (sets of results) so I just have to figure out a set
notation with { }.

e.g.
union( { 1 2 3 } , { 3 4 } , X }

X = { 1 2 3 4 }

So I can avoid the horrors of eliminating quantifiers by making you
write the theorems in set theory notation instead! Haha!

Herc

--
www.microPROLOG.com
if( if(t(S),f(R)) , if(t(R),f(S)) ).
if it's sunny then it's not raining
ergo
if it's raining then it's not sunny










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.