Abstract
The recursion theorem of Richard Dedekind is fundamental for the recursive definition of mappings on natural numbers since it guarantees that the mapping in mind exists and is uniquely determined. Usual set-theoretic proofs are partly intricate and become lengthy when carried out in full detail. We present a simple new proof that is based on a relation-algebraic specification of the notions in question and combines relation-algebraic laws and equational reasoning with Scott induction. It is very formal and most parts of it consist of relation-algebraic calculations. This opens up the possibility for mechanised verification. As an application we prove a relation-algebraic version of the Dedekind isomorphism theorem. Finally, we consider two variants of the recursion theorem to deal with situations which frequently appear in practice but where the original recursion theorem is not applicable.
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 subscriptionsReferences
Avigad, J., Donnelly, K., Gray, D., Raff, P.: A formally verified proof of the prime number theorem. ACM Trans. Comput. Log. 9(1:2), 1–23 (2007)
Berghammer, R., Zierer, H.: Relational algebraic semantics of deterministic and nondeterministic programs. Theor. Comput. Sci. 43, 123–147 (1986)
Berghammer, R.: Mathematik für die Informatik, 3rd edn. Springer, Heidelberg (2019). https://doi.org/10.1007/978-3-658-16712-7
Birkhoff, G.: Lattice Theory, 3rd edn. American Mathematical Society Colloquium Publications, American Mathematical Society, New York (1967)
Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order, 2nd edn. Cambridge University Press, Cambridge (2002)
Dedekind, R.: Was sind und was sollen die Zahlen? Vieweg, Braunschweig (1888)
Kolman, V.: Zahlen. Walter de Gruyter, Berlin (2016)
Lamm, C.: Karl Grandjot und der Dedekindsche Rekursionssatz. Mitt. DMV 24(1), 37–45 (2016)
Landau, E.: Grundlagen der Analysis. Akademische Verlagsgesellschaft, Leipzig (1930)
Loeckx, J., Sieber, K.: The Foundations of Program Verification, 2nd edn. Wiley, Chichester (1987)
Lorenzen, P.: Die Definition durch vollständige Induktion. Monatsh. Math. Phys 47(1), 356–358 (1939)
Maddux, R.D.: Relation Algebras. Elsevier, Amsterdam (2006)
Mathematics Program Construction Group: Fixed-point calculus. Inf. Process. Lett. 53(3), 131–136 (1995)
Schmidt, G., Ströhlein, T.: Relations and Graphs. Monographs on Theoretical Computer Science EATCS. Springer, Heidelberg (1993). https://doi.org/10.1007/978-3-642-77968-8
Tarski, A.: On the calculus of relations. J. Symb. Log. 6(3), 73–89 (1941)
Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pac. J. Math. 5(2), 285–309 (1955)
Acknowledgement
I thank the referees for carefully reading the paper and for their very valuable suggestions.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Berghammer, R. (2020). A Relation-Algebraic Treatment of the Dedekind Recursion Theorem. In: Fahrenberg, U., Jipsen, P., Winter, M. (eds) Relational and Algebraic Methods in Computer Science. RAMiCS 2020. Lecture Notes in Computer Science(), vol 12062. Springer, Cham. https://doi.org/10.1007/978-3-030-43520-2_2
Download citation
DOI: https://doi.org/10.1007/978-3-030-43520-2_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-43519-6
Online ISBN: 978-3-030-43520-2
eBook Packages: Computer ScienceComputer Science (R0)