Jump to content
Sign in to follow this  
anne242

Godels theorem is invalid as his G statement is banned by an axiom of the system he uses to prove his theorem

Recommended Posts

Godels theorem is invalid as his G statement is banned by an axiom of the system he uses to prove his theorem

SPAM LINK DELETED

a flaw in theorem Godels sentence G is outlawed by the very axiom he uses to prove his theorem
ie the axiom of reducibiilty AR -thus his proof is invalid

http://www.enotes.com/topic/Axiom_of_reducibility

russells axiom of reducibility was formed such that impredicative statements were banned


but godels uses this AR axiom in his incompleteness proof ie axiom 1v
and formular 40

and as godel states he is useing the logic of PM ie AR

"P is essentially the system obtained by superimposing on the Peano axioms the logic of PM[ ie AR axiom of reducibility]"

now godel constructs an impredicative statement G which AR was meant
to ban

The impredicative statement Godel constructs is


the corresponding Gödel sentence G asserts: G cannot be proved to be true within the theory T

now godels use of AR bans godels G statement

thus godel cannot then go on to give a proof by useing a statement his own axiom bans
but in doing so he invalidates his whole proof

Edited by Strange
SPAM LINK DELETED

Share this post


Link to post
Share on other sites
!

Moderator Note

Stop spamming your blog. I don't think we need more one thread open to demonstrate your profound ignorance of mathematics so I am locking this one.

 

Share this post


Link to post
Share on other sites
Guest
This topic is now closed to further replies.
Sign in to follow this  

×
×
  • Create New...

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.