Undecidability based on epistemological antinomies V2

....14 Every epistemological antinomy can likewise be used for a similar
undecidability proof...(Gödel 1931:43-44)
*Parphrased as*
Every expression X that cannot possibly be true or false proves that the
formal system F cannot correctly determine whether X is true or false.
Which shows that X is undecidable in F.
Which shows that F is incomplete, even though X cannot possibly be a
proposition in F because propositions must be true or false.
A proposition is a central concept in the philosophy of language,
semantics, logic, and related fields, often characterized as the primary
bearer of truth or falsity.
https://en.wikipedia.org/wiki/Proposition
--
Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer