A fixed point theorem and its use in Kripke's theory of truth

Abstract

Chain iteration methods are used to prove a fixed point theorem for set mappings. As an application, a general rule is constructed for finding in Kripke's theory of truth, based on Strong Kleene evaluation scheme for treating sentences lacking a truth-value, language interpretations containing their truth predicates.

Other Versions

No versions found

Links

PhilArchive

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Similar books and articles

Comparing fixed-point and revision theories of truth.Philip Kremer - 2009 - Journal of Philosophical Logic 38 (4):363-403.
On the weak Kleene scheme in Kripke's theory of truth.James Cain & Zlatan Damnjanovic - 1991 - Journal of Symbolic Logic 56 (4):1452-1468.
Super liars.Philippe Schlenker - 2010 - Review of Symbolic Logic 3 (3):374-414.
Editorial introduction.Volker Halbach - 2001 - Studia Logica 68 (1):3-20.
Yet another hierarchy theorem.Max Kubierschky - 2000 - Journal of Symbolic Logic 65 (2):627-640.
Axiomatizing Kripke’s Theory of Truth.Volker Halbach & Leon Horsten - 2006 - Journal of Symbolic Logic 71 (2):677 - 712.

Analytics

Added to PP
2011-10-03

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references