A Relation-Algebraic Treatment of the Dedekind Recursion Theorem

DOI10.1007/978-3-030-43520-2_2OpenAlexW3013096289MaRDI QIDQ5098710

Rudolf Berghammer

Publication date: 30 August 2022

Published in: Relational and Algebraic Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-43520-2_2

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Karl Grandjot and Dedekind's recursion theorem
• Fixed-point calculus
• Relation algebras
• Relational algebraic semantics of deterministic and nondeterministic programs
• A lattice-theoretical fixpoint theorem and its applications
• Mathematik für die Informatik
• A formally verified proof of the prime number theorem
• Zahlen
• Die Definition durch vollständige Induktion
• On the calculus of relations

This page was built for publication: A Relation-Algebraic Treatment of the Dedekind Recursion Theorem