Binary Kripke Semantics for a Strong Logic for Naive Truth

DOI10.1017/S175502032000043XMaRDI QIDQ6332265arXivFDO

Authors Ben Middleton

Publication date 2 January 2020

Published in arXiv

Full work available at URL https://doi.org/10.1017/S175502032000043X

Mathematics Subject Classification ID

Other nonclassical logic (03B60)

arXiv classification

math.LO

Abstract: I show that the logic $extsf{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 (i) dropping the requirement that the accessibility relation is reflexive and (ii) only allowing reflexive worlds to serve as counterexamples to logical consequence. In addition, I provide a simplified natural deduction system for $extsf{TJK}^{d+}$, in which a restricted form of conditional proof is used to establish conditionals.

This page was built for publication: Binary Kripke Semantics for a Strong Logic for Naive Truth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6332265)