On languages that contain their own ungroundedness predicate
type: Item
instance of: scholarly article
zbMATH Open document ID: 1270.03025
author: Stefan Wintein
publication date: 2012-08-05T00:00:00Z
Mathematics Subject Classification ID: 03A05
zbMATH DE Number: 6063254
zbMATH Keywords: hardest logic problem
zbMATH Keywords: Kripke
zbMATH Keywords: liar
zbMATH Keywords: ungroundedness
zbMATH Keywords: truth-teller
MaRDI profile type: Publication
title: On languages that contain their own ungroundedness predicate
published in: Logique et Analyse. Nouvelle Série
review text: 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)].
reviewed by: Jim Mackenzie
description: scientific article; zbMATH DE number 6063254