XPost: sci.logic, comp.theory

On 8/25/25 1:54 PM, olcott wrote:

All that we must do to defeat the Tarski Undefinability Theorem:

We define the notion of formal system as an extended
version of Prolog's Facts and Rules. This new system
can handle arbitrary orders of logic. Encodes Facts
in formalized natural language.

In other words, restrict them to very simple systems, too simple to
support incompleteness or the limitation of the truth predicate.

That is because prolog can't handle the properties of the Natural Numbers.

The Rules only allow semantic logical entailment from
Facts. When we do this Tarski's Liar Paradox basis is
simply rejected as untrue and
Boolean True(Language L, Expression E) becomes definable.

And doesn't allow us to define the Arithmatic of Natural Numbers.

Sorry, you don't understand the limitations of your logic.

--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)