On the Foundations of Corecursion

DOI10.1093/JIGPAL/5.2.231MaRDI QIDQ3126405zbMATH OpenOpenAlexWikidataFDO

Authors Lawrence S. Moss, Norman Danner

Publication date 2 June 1997

Published in Logic Journal of the IGPL (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/5d136af4e9c757362ed609485aceee3688b43fb6

zbMATH Keywords

coalgebradefinition of functions by corecursionfixed pointnon-wellfounded setsoperator on sets

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Other set-theoretic hypotheses and axioms (03E65)

Recommendations

• Foundational extensible corecursion: a proof assistant perspective
• Axiomatizing core extensions
• Corecursive algebras: a study of general structured corecursion
• A new foundation for finitary corecursion and iterative algebras
• scientific article; zbMATH DE number 1390274
• Axiomatizations of the core on the universal domain and other natural domains
• scientific article; zbMATH DE number 1497870
• Foundations of regular coinduction
• A non-cooperative axiomatization of the core
• Computer Aided Systems Theory – EUROCAST 2005

Cited in

(9)

• Coalgebraic logic
• Universal coalgebra: A theory of systems
• Proof relevant corecursive resolution
• Foundational extensible corecursion: a proof assistant perspective
• Friends with benefits. Implementing corecursion in foundational proof assistants
• Transfinite corecursion
• A generic framework for symbolic execution: a coinductive approach
• Game characterizations and lower cones in the Weihrauch degrees
• Parametric corecursion

This page was built for publication: On the Foundations of Corecursion

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