Abstract
We are going to generalize classical λ-calculus to the ordinal domain. Our reasoning is centered around a generalization of Church numerals, i.e., terms that define the n-fold application of their first argument to the second, to numerals for transfinite ordinals. Once the new class of ordinal λ-terms is established, we define a transfinite procedure to assign to a given ordinal λ-term a normal form if one exists. This normal form procedure is compatible with the classical case, i.e., will find normal forms for classical terms whenever they exist. We go on to prove a confluence property for our procedure. The calculus thus defined is tied into the existing framework of ordinal computability: Using our terms to define a class of functions on the ordinals, we show that this class is identical with the class of \(\mathbf\Sigma_1(L)\) definable functions on Ord. This paper takes the form of an ‘extended abstract’: The technical details of the main definition, detailed examples, as well as proofs of the theorems are omitted for brevity.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Fischbach, T.: The Church-Turing Thesis for Ordinal Computable Functions. Master’s thesis, University of Bonn (October 2010)
Koepke, P.: Turing computations on ordinals. The Bulletin of Symbolic Logic 11, 377–397 (2005)
Koepke, P., Siders, R.: Register computations on ordinals. Submitted to: Archive for Mathematical Logic, 14 pages (2006)
Jensen, R.B., Karp, C.: Primitive recursive set functions. In: Scott, D.S. (ed.) Axiomatic Set Theory. Volume XIII (Part 1) of Proceedings of Symposia in Pure Mathematics, pp. 143–176. American Mathematical Society, Providence (1971)
Barendregt, H.P.: The lambda calculus. Its syntax and semantics. In: Studies in Logic and the Foundations of Mathematics. North/Holland Publishing Company, Amsterdam (1981)
Church, A., Rosser, J.B.: Some properties of conversion. Transactions of the American Mathematical Society 39(3), 472–482 (1936)
Devlin, K.J.: Aspects of constructibility. Lecture Notes in Mathematics. Springer, Heidelberg (1973)
Schlicht, P., Seyfferth, B.: Tree representations and ordinal machines. Computability 1(1), 45–57 (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fischbach, T., Seyfferth, B. (2013). On λ-Definable Functions on Ordinals. In: Bonizzoni, P., Brattka, V., Löwe, B. (eds) The Nature of Computation. Logic, Algorithms, Applications. CiE 2013. Lecture Notes in Computer Science, vol 7921. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39053-1_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-39053-1_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39052-4
Online ISBN: 978-3-642-39053-1
eBook Packages: Computer ScienceComputer Science (R0)