Interpreting the compositional truth predicate in models of arithmetic

Cezary Cieśliński · Archive for Mathematical Logic · 2021

Abstract We present a construction of a truth class (an interpretation of a compositional truth predicate) in an arbitrary countable recursively saturated model of first-order arithmetic. The construction is fully classical in that it employs nothing more than the classical techniques of formal proof theory.

Read the paper · More papers on PaperTik