On languages that contain their own ungroundedness predicate
In Kripke's fixed-point construction, paradoxical sentences are neither true nor false, but ungrounded. Here, ungroundedness is treated as a third truth value, and the conditions specified under which an interpreted language can contain its own ungroundedness predicate, so that ``\(\sigma\) is ungrounded'' is true just in case \(\sigma\) is ungrounded. The result is then applied to the reasoning of the truth-teller by \textit{B. Rabern} and \textit{L. Rabern} in their paper [Analysis, Oxf. 68, No. 2, 105--112 (2008; Zbl 1143.03317)].
scientific article; zbMATH DE number 6063254