vix.ing · top · new · best · stats · spec

KF, PKF, and Reinhardt's Program

2020/05/03 by Luca Castaldo, Castaldo, Luca, Johannes Stern +1
Arts and Humanities · Computer Science · Psychology · #03A05 #Computability, Logic, AI Algorithms #FOS: Mathematics #Logic (math.LO) #Philosophy and History of Science #Philosophy and Theoretical Science

paper · pdf · doi:10.48550/arxiv.2005.01054

openalex publication_date 2020/05/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In 'Some Remarks on Extending an Interpreting Theories with a Partial Truth Predicate' Reinhardt famously proposed an instrumentalist interpretation of the truth theory Kripke-Feferman (KF) in analogy to Hilbert's program. Reinhardt suggested to view KF as a tool for generating 'the significant part of KF', that is, as a tool for deriving sentences of the form T\ulcornerφ\urcorner. The constitutive question of Reinhardt's program was whether it was possible "to justify the use of nonsignificant sentences entirely within the framework of significant sentences"? This question was answered negatively by Halbach and Horsten (2006) but we argue that under a more careful interpretation the question may receive a positive answer. To this end, we propose to shift attention from KF-provably true sentences to KF-provably true inferences, that is, we shall identify the significant part of KF with the set of pairs ⟨Γ, Δ⟩, such that KF proves that if all members of Γ are true, at least one member of Δ is true. In way of addressing Reinhardt's question we show that the provably true inferences of KF coincide with the provable sequents of the theory Partial Kripke-Feferman (PKF).

Citations

Related