Sujet : Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable
De : rjh (at) *nospam* cpax.org.uk (Richard Heathfield)
Groupes : comp.theoryDate : 07. May 2025, 09:05:23
Autres entêtes
Organisation : Fix this later
Message-ID : <vvf483$sq03$1@dont-email.me>
References : 1 2 3 4 5 6
User-Agent : Mozilla Thunderbird
On 06/05/2025 15:36, olcott wrote:
<snip>
Try to provide one simple concrete example where we
begin with truth and only apply truth preserving
operations and end up with undecidability.
https://www.cs.virginia.edu/~robins/Turing_Paper_1936.pdf-- Richard HeathfieldEmail: rjh at cpax dot org dot uk"Usenet is a strange place" - dmr 29 July 1999Sig line 4 vacant - apply within