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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,779

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

Supervaluation fixed-point logics of truth.Philip Kremer & Alasdair Urquhart - 2008 - Journal of Philosophical Logic 37 (5):407-440.
A fixed point theorem for the weak Kleene valuation scheme.Anil Gupta & Robert L. Martin - 1984 - Journal of Philosophical Logic 13 (2):131 - 135.
The fixed points of belief and knowledge.Daniela Schuster - forthcoming - Logic Journal of the IGPL.
From Closure Games to Strong Kleene Truth.Stefan Wintein - 2016 - Notre Dame Journal of Formal Logic 57 (2):153-179.
Axiomatizing Kripke’s Theory of Truth.Volker Halbach & Leon Horsten - 2006 - Journal of Symbolic Logic 71 (2):677 - 712.
Logic and Truth.Michael Joseph Kremer - 1986 - Dissertation, University of Pittsburgh
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.

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