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: VENN DIAGRAM of FORMAL SYSTEM TYPES
Replies: 1   Last Post: Feb 11, 2013 12:21 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,338
Registered: 5/20/10
VENN DIAGRAM of FORMAL SYSTEM TYPES
Posted: Feb 9, 2013 9:09 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply


|-------------STRINGS----------|
|
| abc^*z qed
|
|
| /--------WFF---------\
| /
| / PARADOXES X=~X
| / FALSE FORMULA ~X=X
| /
| |
| | /---THEOREMS-----\
| | /
| | | BT(S(0),0)
| | |
| | | ------------\
| | | / THEOREMS
| | | | STARTING
| | | | WITH NOT
| | | |
| | | | ~(BT(0,X)
| | | \------------/
| | |
| | \
| | \-----------------/
| \
| \
| \
| \--------------------/
|
|
|-----------------------------|


WFF C STRINGS
THEOREMCS C WFF
THEOREMS starting with NOT(....) C THEOREMS


----

A SET type can also be useful in programming
to instantiate "russell" into X in X~eX


----

Godel's Proof does not use this model.

Can anyone figure out why?


Herc
--
www.BLoCKPROLOG.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.