# anne242

Members

8

-2 Poor

• Rank
Lepton

## Recent Profile Visitors

The recent visitors block is disabled and is not being shown to other users.

2. ## Mathematics ends in contradiction-an integer=a non-integer

its all very simple really 1 is a finite number it stops A finite decimal is one that stops, like 0.157 A non-finite decimal like 0.999... does not stop when a finite number 1 = a non-finite number 0.999.. then maths ends in contradiction another way 1 is an integer a whole number 0.888... is a non-integer it is not a whole number 0.999... is a non-integer not a whole number when a integer 1 =a non-integer 0.999... maths ends in contradiction
3. ## Godels theorem is invalid as his G statement is banned by an axiom of the system he uses to prove his theorem

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 https://en.wikipedia.org/wiki/Gödel's_incompleteness_theorems 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
4. ## Godel's 2nd theorem ends in paradox

Godel's 2nd theorem ends in paradox Godel's 2nd theorem is about SPAM LINK DELETED "If an axiomatic system can be proven to be consistent and complete from within itself, then it is inconsistent.” But we have a paradox Gödel is using a mathematical system his theorem says a system cant be proven consistent THUS A PARADOX Godel must prove that a system cannot be proven to be consistent based upon the premise that the logic he uses must be consistent . If the logic he uses is not consistent then he cannot make a proof that is consistent. So he must assume that his logic is consistent so he can make a proof of the impossibility of proving a system to be consistent. But if his proof is true then he has proved that the logic he uses to make the proof must be consistent, but his proof proves that this cannot be done THUS A PARADOX
5. ## Gödel’s 1st theorem is meaningless as Godel cant tell us what makes a maths statement true

Gödel’s 1st theorem is meaningless as Godel cant tell us what makes a maths statement true SPMA LINK DELETED Gödel’s 1st theorem states a) “Any effectively generated theory capable of expressing elementary arithmetic cannot be both consistent and complete. In particular, for any consistent, effectively generated formal theory that proves certain basic arithmetic truths, there is an arithmetical statement that is true,[1] but not provable in the theory (Kleene 1967, p. 250) note "... there is an arithmetical statement that is true..." In other words there are true mathematical statements which cant be proven But the fact is Godel cant tell us what makes a mathematical statement true thus his theorem is meaningless

7. ## Mathematics ends in contradiction-an integer=a non-integer

1)Mathematics/science end in contradiction-an integer=a non-integer. When mathematics/science end in contradiction it is proven in logic that you can prove anything you want in mathematics ie you can prove Fermat's last theorem and you can disprove Fermat's last theorem http://gamahucherpress.yellowgum.com/wp-content/uploads/All-things-are-possible.pdf The paper proves 1 is a finite number it stops A finite decimal is one that stops, like 0.157 A non-finite decimal like 0.999... does not stop when a finite number 1 = a non-finite number 0.999.. then maths ends in contradiction another way 1 is an integer a whole number 0.888... is a non-integer it is not a whole number 0.999... is a non-integer not a whole number when a integer 1 =a non-integer 0.999... maths ends in contradiction
8. ## Acceleration of a spinning sphere

As was pointed out it s all about what order the rotations occur
×