On elementary theories of ordinal notation systems based on reflection principles
L.D. Beklemishev has recently introduced a constructive ordinal notation system for the ordinal ɛ 0. We consider this system and its fragments for smaller ordinals ω n (towers of ω-exponentiations of height n). These systems are based on Japaridze’s well-known polymodal provability logic. They are used in the technique of ordinal analysis of the Peano arithmetic PA and its fragments on the basis of iterated reflection schemes. Ordinal notation systems can be regarded as models of the first-order language. We prove that the full notation system and its fragments for ordinals ≥ω 4 have undecidable elementary theories. At the same time, the fragments of the full system for ordinals ≤ω 3 have decidable elementary theories. We also obtain results on decidability of the elementary theory for ordinal notation systems with weaker signatures.
KeywordsSTEKLOV Institute Elementary Theory Predicate Symbol Proof Theory Maximal Subsequence
Unable to display preview. Download preview PDF.
- 3.L. D. Beklemishev, “Veblen hierarchy in the context of provability algebras,” in Logic, Methodology and Philosophy of Science: Proc. 12th Int. Congr., Oviedo (Spain), 2003 (King’s College Publ., London, 2005), pp.65–78.Google Scholar
- 5.L. Braud, “Covering of ordinals,” in IARCS Annu. Conf. on Foundations of Software Technology and Theoretical Computer Science, Kanpur (India), 2009 (Schloss Dagstuhl-Leibniz Zentrum Inf., Wadern, 2009), Leibniz Int. Proc. Inf. 4, pp. 97–108.Google Scholar
- 14.G. K. Japaridze, “The modal logical means of investigation of provability,” Cand. Sci. (Philos.) Dissertation (Moscow State Univ., Moscow, 1986).Google Scholar
- 19.A. Mostowski and A. Tarski, “Arithmetical classes and types of well ordered systems,” Bull. Am. Math. Soc. 55(1), 65 (1949).Google Scholar
- 21.W. Pohlers, Proof Theory: The First Step into Impredicativity (Springer, Berlin, 2008), Universitext.Google Scholar
- 23.H. Rogers, Jr., Theory of Recursive Functions and Effective Computability (MIT Press, Cambridge, MA, 1987).Google Scholar
- 25.G. Takeuti, Proof Theory (North-Holland, Amsterdam, 1987), Stud. Logic Found. Math. 81.Google Scholar