At 23:12 12/12/04 -0500, Jesse Mazer wrote:
Hal Ruhl wrote:
At 09:35 PM 12/12/2004, you wrote:
Godel's theorem would also apply to infinite axiomatic systems whose
axioms are recursively enumerable (computable). But sure, if you allow
non-computable axiomatic systems, you could have one that was
Hi Jesse and Bruno:
To consolidate my response:
Yes indeed. Most books give different definition of axiomatic and
recursively enumerable, but there is
a theorem by Craig which shows that for (most) theories, the notion are
equivalent. (See Boolos and Jeffrey for
a proof of Craig's theorem).
Hi Jesse:
I will go over the thread and try to clear things up but I am having eye
surgery in the morning and ran out of time.
Why would mathematics be the only thing in the All? Is that not a selection?
At 07:38 PM 12/13/2004, you wrote:
It is controversial that mathematics contains any
3 matches
Mail list logo
