A concrete final coalgebra theorem for ZF set theory

6Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A special final coalgebra theorem, in the style of Aczel’s [2], is proved within standard Zermelo-Fraenkel set theory. Aczel’s Anti- Foundation Axiom is replaced by a variant definition of function that admits non-well-founded constructions. Variant ordered pairs and tuples, of possibly infinite length, are special cases of variant functions. Analogues of Aczel’s Solution and Substitution Lemmas are proved in the style of Rutten and Turi [12]. The approach is less general than Aczel’s, but the treatment of non-well-founded objects is simple and concrete. The final coalgebra of a functor is its greatest fixedpoint. The theory is intended for machine implementation and a simple case of it is already implemented using the theorem prover Isabelle [10].

Cite

CITATION STYLE

APA

Paulson, L. C. (1995). A concrete final coalgebra theorem for ZF set theory. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 996, pp. 120–139). Springer Verlag. https://doi.org/10.1007/3-540-60579-7_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free