Abstract
As is mentioned in Leigh :845-865, 2015), it is an open problem whether for several axiomatic theories of truth, including Friedman–Sheard theory \ and Kripke–Feferman theory \ :690-716, 1976), there exist cut-elimination arguments that give the upper bounds of their proof-theoretic strengths. In this paper, we give complete cut-elimination results for several well-known axiomatic theories of truth. In particular, we treat the systems \, and \ \\) of Friedman and Sheard’s theories and \.