Re: non-Archimedean models of Euclidean geometry?



On Mon, 09 Mar 2009 15:10:38 +0200, Aatu Koskensilta
<aatu.koskensilta@xxxxxx> wrote:

Gc <Gcut667@xxxxxxxxxxx> writes:

There are no non-archimedian models for this theory. There is up to
isomorphism exactly one model for each infinite cardinal. That follows
from that the theory is complete.

No, it doesn't. Consider for example Presburger arithmetic.

I gave what seems to me to be a very simple counterexample,
the language with exactly one unary predicate P and the
theory being "there exist infinitely many x such that P(x)
and there exist infinitely many x such that ~P(x)"
(formalized in the obvious way as a collection of fol wffs).

It seems "clear" to me that this theory is complete, but
I have no idea how I'd prove it. Does it seem clearly
complete to you, and if so does it seem to you the
proof should be clear as well?


David C. Ullrich

"Understanding Godel isn't about following his formal proof.
That would make a mockery of everything Godel was up to."
(John Jones, "My talk about Godel to the post-grads."
in sci.logic.)
.



Relevant Pages

  • Re: Infinite Binary Strings: THE ANSWER : 3 VALUED LOGIC
    ... the half interval P lies on we can ask which half ... aperiodic, infinite string eg LRRLLLR...... ... logic is simply stupid. ... "Understanding Godel isn't about following his formal ...
    (sci.math)
  • Re: Infinite Binary Strings: THE ANSWER : 3 VALUED LOGIC
    ... aperiodic, infinite string eg LRRLLLR...... ... have three possible _truth values_. ... nothing wrong with 3 valued logic david!!! ... That would make a mockery of everything Godel was ...
    (sci.math)
  • Re: but that is not possible
    ... both infinite sets (such as being larger than any ... Just to get an idea of what you mean by "in reality": ... david admits his doubts on ' completed ' infinity. ... "Understanding Godel isn't about following his formal ...
    (sci.math)
  • Re: Computable functions/reals.
    ... finite time is finite. ... read an infinite tape one character at a time. ... "Understanding Godel isn't about following his formal proof. ...
    (sci.logic)
  • Re: card(P(N)) = card(N), an elementary proof
    ... the argument is going to hold due to this bijection ... We pass from Pto Pby transfinite induction, ... from the finite case to the infinite case. ... "Understanding Godel isn't about following his formal ...
    (sci.math)