On Gupta-Belnap Revision Theories of Truth, Kripkean Fixed Points, and The Next Stable Set
From MaRDI portal
Publication:2778662
DOI10.2307/2687753zbMath1009.03006OpenAlexW2097928766MaRDI QIDQ2778662
No author found.
Publication date: 20 March 2002
Published in: Bulletin of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: http://www.math.ucla.edu/~asl/bsl/0703-toc.htm
truth theoryrevision theory of truthfixed-point theoryalgorithmic theory of truthcomplexity of definitions
Related Items (10)
One hundred years of semantic paradox ⋮ SOLOVAY-TYPE THEOREMS FOR CIRCULAR DEFINITIONS ⋮ Conditionals in theories of truth ⋮ REVISION REVISITED ⋮ Guest editors' introduction ⋮ Revision without revision sequences: self-referential truth ⋮ Some notes on truths and comprehension ⋮ A NOTE ON THEORIES FOR QUASI-INDUCTIVE DEFINITIONS ⋮ Cofinally invariant sequences and revision ⋮ Comparing inductive and circular definitions: Parameters, complexity and games
Cites Work
- Unnamed Item
- Unnamed Item
- Notes on naive semantics
- Elementary induction on abstract structures
- Handbook of computability theory
- The Gupta-Belnap systems \({\mathbf S}^ \#\) and \({\mathbf S}^*\) are not axiomatisable
- A revision-theoretic analysis of the arithmetical hierarchy
- Alternative revision theories of truth
- Truth and paradox
- Revision Sequences and Computers with an Infinite Amount of Time
- The truth is never simple
- A guide to truth predicates in the modern era
- Eventually infinite time Turing machine degrees: infinite time decidable reals
This page was built for publication: On Gupta-Belnap Revision Theories of Truth, Kripkean Fixed Points, and The Next Stable Set