Re: technical terms overhaul

[Celejar <celejar@gmail.com>]

On Sat, 20 Jun 2020 20:47:36 +0200
"Thomas Schmitt" <scdbackup@gmx.net> wrote:

> Hi,
> 
> deloptes wrote:
> > by logic and ontology there is either P or not P that can be true
> 
> Any system of thought, which follows the principles of classical logic
> and which contains the usual math of natural numbers, contains statements
> which are neither true nor false.
> Kurt Goedel. Incompleteness theorem.
>   https://en.wikipedia.org/wiki/On_Formally_Undecidable_Propositions_of_Principia_Mathematica_and_Related_Systems

No - Gödel proved that any such (formal) system will contain statements
such that neither they nor their negations are *provable within the
system*. These statements are actually "true", using a normal
definition of truth.

https://en.wikipedia.org/wiki/G%C3%B6del%27s_incompleteness_theorems

Celejar