Binary Kripke Semantics for a Strong Logic for Naive Truth

Review of Symbolic Logic:1-25 (forthcoming)
  Copy   BIBTEX

Abstract

I show that the logic $\textsf {TJK}^{d+}$, one of the strongest logics currently known to support the naive theory of truth, is obtained from the Kripke semantics for constant domain intuitionistic logic by dropping the requirement that the accessibility relation is reflexive and only allowing reflexive worlds to serve as counterexamples to logical consequence. In addition, I provide a simplified natural deduction system for $\textsf {TJK}^{d+}$, in which a restricted form of conditional proof is used to establish conditionals.

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 106,314

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2020-12-22

Downloads
77 (#294,319)

6 months
5 (#852,111)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

Outline of a theory of truth.Saul Kripke - 1975 - Journal of Philosophy 72 (19):690-716.
Universal Logic.Ross Brady - 2006 - Bulletin of Symbolic Logic 13 (4):544-547.
Curry’s Paradox and ω -Inconsistency.Andrew Bacon - 2013 - Studia Logica 101 (1):1-9.

View all 10 references / Add more references