A Relation-Algebraic Treatment of the Dedekind Recursion Theorem

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

Authors: 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

Recommendations

• Set theory for verification. II: Induction and recursion
• Reasoning algebraically about recursion
• scientific article; zbMATH DE number 1752463
• scientific article; zbMATH DE number 2037780
• A calculational approach to mathematical induction

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

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

Cited In (7)

• Recursion relations for double ramification hierarchies
• Some acyclic relations in the lambda algebra
• From recursions to asymptotics: Durfee and dilogarithmic deductions
• Relation-algebraic verification of disjoint-set forests
• Title not available (Why is that?)
• A generalization of Pincherle's theorem to \(k\)-term recursion relations
• An extension of the nondiamond theorem in classical and α-recursion theory

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5098710)