On languages that contain their own ungroundedness predicate (Q2904042)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6063254
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On languages that contain their own ungroundedness predicate |
scientific article; zbMATH DE number 6063254 |
Statements
5 August 2012
0 references
hardest logic problem
0 references
Kripke
0 references
liar
0 references
ungroundedness
0 references
truth-teller
0 references
On languages that contain their own ungroundedness predicate (English)
0 references
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)].
0 references
0.7855741381645203
0 references
0.7409628629684448
0 references
0.7369322776794434
0 references
