On the Foundations of Corecursion

DOI10.1093/jigpal/5.2.231zbMath0872.03030OpenAlexW1977815132WikidataQ56486106 ScholiaQ56486106MaRDI QIDQ3126405

Norman Danner, Lawrence S. Moss

Publication date: 2 June 1997

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

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

zbMATH Keywords

fixed pointcoalgebranon-wellfounded setsoperator on setsdefinition of functions by corecursion

Mathematics Subject Classification ID

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

Related Items (5)

Game characterizations and lower cones in the Weihrauch degrees ⋮ A generic framework for symbolic execution: a coinductive approach ⋮ Proof Relevant Corecursive Resolution ⋮ Coalgebraic logic ⋮ Universal coalgebra: A theory of systems

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