Every coalgebra for a well-founded functor on a category of families indexed by a well-founded relation is recursive.
Modelling general recursion in type theory
2 Pith papers cite this work, alongside 85 external citations. Polarity classification is still indexing.
2
Pith papers citing it
85
external citations · OpenAlex
representative citing papers
A central lemma (Lemma 7.7) is false, breaking the proof of Theorem 7.5 that countable meets of semidecidable propositions are ω²-decidable.
citing papers explorer
-
Intrinsically Correct Algorithms and Recursive Coalgebras
Every coalgebra for a well-founded functor on a category of families indexed by a well-founded relation is recursive.