From: Erin (macavity11@yahoo.com)
Date: Mon Nov 29 2004 - 03:04:40 GMT
Mark Steven Heyman <markheyman@infoproconsulting.com> wrote:
On 28 Nov 2004 at 8:34, Scott Roberts wrote:
platt:
The limits of ordinary logic were well known by Western philosophers
even before Godel formalized it's basic contradiction.
scott:
> > Godel didn't show it as being contradictory, only incomplete.
>
platt:
> Godel showed it as being contradictory in proving there's no such
> thing as proof.
scott:
Well, no. It proves that there exist arithmetical statements that are
true but unprovable, which means that arithmetic is incomplete. But
there are an infinite number of provable arithmetic statements, such
as "2+2=4" and "there is no greatest prime number." Godel's Theorem
does not change their provability in the slightest.
I saw a site where somebody made some math joke and I didn't get it, but it seems like it might be relevent to this but I don't know enough about math to know what this was about. But somebody said a statement about 2+1 =3 (I think this was it, might be another simple addition problem) and that we know that for sure... Then somebody said not in mod 3 it isn't. Does that make sense to anyone?
MOQ.ORG - http://www.moq.org
Mail Archives:
Aug '98 - Oct '02 - http://alt.venus.co.uk/hypermail/moq_discuss/
Nov '02 Onward - http://www.venus.co.uk/hypermail/moq_discuss/summary.html
MD Queries - horse@darkstar.uk.net
To unsubscribe from moq_discuss follow the instructions at:
http://www.moq.org/md/subscribe.html
This archive was generated by hypermail 2.1.5 : Mon Nov 29 2004 - 03:22:09 GMT