Abstract
AbstractWe consider various concepts associated with the revision theory of truth of Gupta and Belnap. We categorize the notions definable using theirtheory of circular definitionsas those notions universally definable overthe next stable set. We give a simplified (in terms of definitional complexity) account ofvaried revision sequences—as ageneralised algorithmic theory of truth. This enables something of a unification with the Kripkean theory of truth using supervaluation schemes.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
