Abstract
Abstract
We study a generalization of the notion of conservativity spectrum of an arithmetical theory to a language with transfinitely many truth definitions. We establish a natural correspondence of conservativity spectra and points of a special Kripke model introduced and studied by D. Fernández–Duque and J. Joosten. For iterated reflection principles over theories of truth definitions we also establish conservation results analogous to the well-known Schmerl formulas.
Reference10 articles.
1. L. Beklemishev and F. Pakhomov, “Reflection algebras and conservation results for theories of iterated truth,” Ann. Pure Appl. Logic (2022). https://doi.org/10.1016/j.apal.2022.103093
2. L. D. Beklemishev, “Proof-theoretic analysis by iterated reflection,” Arch. Math. Logic 42, 515–552 (2003).
3. L. D. Beklemishev, “Veblen hierarchy in the context of provability algebras,” in Logic, Methodology, and Philosophy of Science: Proceedings of the 12th International Congress, Ed. by P. Hájek, L. Valdés-Villanueva, and D. Westerståhl (Kings College, London, 2005), pp. 65–78.
4. L. D. Beklemishev, “Reflection calculus and conservativity spectra,” Russ. Math. Surv. 73 (4), 569–613 (2018).
5. S. Feferman, “Arithmetization of metamathematics in a general setting,” Fundam. Math. 49, 35–92 (1960).