Re: The key undecidable instance that I know about

On 3/9/25 1:15 PM, olcott wrote:

Is the Liar Paradox True or False?
 LP := ~True(LP)
 ?- LP = not(true(LP)).
LP = not(true(LP)).
 ?- unify_with_occurs_check(LP, not(true(LP))).
false.
 Its infinitely recursive structure makes it neither true nor false.
 

The liar's paradox isn't an "undecidable" instance, as "undecidable" is about a problem that has a true or false answer that can not be computed for every case.
This just goes back your your ignorance of what you talk about and that your whole life appears to have been build on just committing FRAUD when you could, as you have admitted by your admittion that you recent work is based on changes to the core definitions of terms-of-art, while still claiming to be working on the problems that used those terms.
Sorry, you are just proving that you are ignorant of the Nature of Logic.