Re: Question on Chaitin

From: Jim Spriggs <jim.sprigs@xxxxxxxxxxxxxxxxxxxxxxxxxxxxxx>
Date: Sat, 14 May 2005 15:23:16 +0000 (UTC)

george wrote:
>
> .... Both PA and ZFC (arguably)
> have only one binary predicate, and it is (in both cases)
> axiomatically strongly IRreflexive.

What is it in the case of PA?
.

References:
- Question on Chaitin
  - From: David Costa
- Re: Question on Chaitin
  - From: george

Prev by Date: Re: Question on Chaitin
Next by Date: Re: A simple undiagonalisable list - ILLUSTRATED
Previous by thread: Re: Question on Chaitin
Next by thread: Re: Question on Chaitin
Index(es):
- Date
- Thread

Relevant Pages

Re: Who believes/believed that set theory is/was inconsistent?
... george wrote: ... ZFC is inconsistent. ... Prev by Date: ...
(sci.logic)
Re: Cantors circular "proof" that evens = integers
... george wrote: ... it only follows that ZFC ... That is entirely meaningless. ... MANY DIFFERENT NON-isomorphic models, and EVERYthing ...
(sci.logic)
Re: Extrapolating linear ratios
... PLEEEZE, george, DON'T argue in favor a complete crackpot. ... ASSHOLE, FULL OF SHIT!!! ... we can prove in ZFC: ...
(sci.logic)
Re: Question about the Diagonal Method.
... george writes: ... ZFC to appreciate the diagonal argument. ... - Ludwig Wittgenstein, Tractatus Logico-Philosophicus ...
(sci.logic)