Abstract
AbstractWe 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.
Publisher
Springer Science and Business Media LLC
Reference22 articles.
1. Cieśliński, C.: Deflationary truth and pathologies. J. Philos. Log. 39(3), 325–337 (2010)
2. Cieśliński, C.: The innocence of truth. Dialectica 69(1), 61–85 (2015). https://doi.org/10.1111/1746-8361.12093
3. Cieśliński, C.: The Epistemic Lightness of Truth, Deflationism and its Logic. Cambridge University Press, Cambridge (2017)
4. Lecture Notes in Computer Science;C Cieśliński,2019
5. Enayat, A., Visser, A.: Full satisfaction classes in a general setting (Part 1). Unpublished draft (2012)