Truth, Partial Logic and Infinitary Proof Systems

Studia Logica 106 (3):1-26 (2017)
  Copy   BIBTEX

Abstract

In this paper we apply proof theoretic methods used for classical systems in order to obtain upper bounds for systems in partial logic. We focus on a truth predicate interpreted in a Kripke style way via strong Kleene; whereas the aim is to connect harmoniously the partial version of Kripke–Feferman with its intended semantics. The method we apply is based on infinitary proof systems containing an ω-rule.

Other Versions

reprint Gratzl, Norbert; Fischer, Martin (2018) "Truth, Partial Logic and Infinitary Proof Systems". Studia Logica 106(3):515-540

Analytics

Added to PP
2017-09-26

Downloads
190 (#212,840)

6 months
33 (#267,487)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Citations of this work

KF, PKF and Reinhardt’s Program.Luca Castaldo & Johannes Stern - 2022 - Review of Symbolic Logic 1:33-58.
On the Costs of Classical Logic.Luca Castaldo - 2021 - Erkenntnis 88 (3):1157-1188.

Add more citations

References found in this work

Outline of a theory of truth.Saul Kripke - 1975 - Journal of Philosophy 72 (19):690-716.
Saving truth from paradox.Hartry Field - 2008 - New York: Oxford University Press.
In Contradiction.Graham Priest - 2006 - Oxford, GB: Clarendon Press.
Axiomatizing Kripke’s Theory of Truth.Volker Halbach & Leon Horsten - 2006 - Journal of Symbolic Logic 71 (2):677 - 712.
On the Costs of Nonclassical Logic.Volker Halbach & Carlo Nicolai - 2018 - Journal of Philosophical Logic 47 (2):227-257.

View all 13 references / Add more references