Path: csiph.com!eternal-september.org!feeder.eternal-september.org!reader01.eternal-september.org!.POSTED!not-for-mail
From: Keith Thompson <kst-u@mib.org>
Newsgroups: comp.lang.prolog,comp.lang.c++,comp.lang.c,comp.lang.lisp
Subject: Re: Eliminating Undecidability and Incompleteness in Formal Systems (Prolog already does this)
Followup-To: comp.lang.prolog
Date: Fri, 26 Apr 2019 19:43:15 -0700
Organization: None to speak of
Lines: 15
Message-ID: <ln7ebgyxq4.fsf@kst-u.example.com>
References: <2_ydnT3SYPULgV7BnZ2dnUU7-cnNnZ2d@giganews.com>
Mime-Version: 1.0
Content-Type: text/plain; charset=utf-8
Content-Transfer-Encoding: 8bit
Injection-Info: reader02.eternal-september.org; posting-host="c6e41c1d9a96363646e2c0eae7343784"; logging-data="24259"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX1/4VyggLiG3oO8qrp2Uxp6L"
User-Agent: Gnus/5.13 (Gnus v5.13) Emacs/23.1 (gnu/linux)
Cancel-Lock: sha1:gIgUEZ58r2gXwZL+xrshhe4JNrM= sha1:E0aM+M/ce/ftzi8yffuIQibrdMY=
Xref: csiph.com comp.lang.prolog:9168 comp.lang.c++:65309 comp.lang.c:143483 comp.lang.lisp:32775

peteolcott <Here@Home> writes:
> Prolog already implements the sound deductive inference model.
[...]
> This simple little system shows that Gödel's Incompleteness Theorem
> and the Tarski Undefinability Theorem are false.
[...]

Please restrict followups to relevant newsgroups.  In particular,
this is off topic in comp.lang.c++ and comp.lang.c, and probably
in comp.lang.lisp as well.

-- 
Keith Thompson (The_Other_Keith) kst-u@mib.org  <http://www.ghoti.net/~kst>
Will write code for food.
void Void(void) { Void(); } /* The recursive call of the void */