We consider various concepts associated with the revision theory of truth of Gupta and Belnap. We categorize the notions definable using their theory of circular definitions as those notions universally definable over the next stable set. We give a simplified (in terms of definitional complexity) account of varied revision sequences - as a generalised algorithmic theory of truth. This enables something of a unificiation with the Kripkean theory of truth using supervaluation schemes.
|Translated title of the contribution||On Gupta-Belnap revision theories of truth, Kripkean fixed points, and the next stable set|
|Pages (from-to)||345 - 360|
|Number of pages||16|
|Journal||Bulletin of Symbolic Logic|
|Publication status||Published - Sep 2001|