A different perspective on undecidability

The whole notion of undecidability is anchored in ignoring the fact that
some expressions of language are simply not truth bearers. When neither
YES nor NO is the correct answer to a YES/NO question then the question
itself is incorrect.
We can correct this problem very easily by applying truth preserving
operations to expressions of language that have been stipulated to be
true.
When this forms the foundation for a Tarski like:
True(L, x) predicate then ~True(L, x) & ~True(L, ~x) means that x is not
a truth bearer. When we do this then LP := ~True(LP) is rejected not a
truth bearer.
--
Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer