A Concrete Final Coalgebra Theorem for ZF Set Theory

@inproceedings{Paulson1994ACF,
  title={A Concrete Final Coalgebra Theorem for ZF Set Theory},
  author={Lawrence C. Paulson},
  booktitle={TYPES},
  year={1994}
}
A special final coalgebra theorem, in the style of Aczel’s [2], is proved within standard Zermelo-Fraenkel set theory. Aczel’s AntiFoundation 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… CONTINUE READING
Highly Cited
This paper has 29 citations. REVIEW CITATIONS

References

Publications referenced by this paper.
Showing 1-9 of 9 references

Non-Well-Founded Sets, CSLI

P. Aczel
1988
View 20 Excerpts
Highly Influenced

Set theory for veri cation: II. Induction and recursion

L. C. Paulson
Tech. Rep. 312, Comp. Lab., Univ. Cambridge, • 1993
View 5 Excerpts
Highly Influenced

Terminal Coalgebras in Well-Founded Set Theory

Theor. Comput. Sci. • 1993
View 4 Excerpts
Highly Influenced

A Final Coalgebra Theorem

Category Theory and Computer Science • 1989
View 4 Excerpts
Highly Influenced

Set theory for verification: I. From foundations to functions

Journal of Automated Reasoning • 1993
View 5 Excerpts

Co-Induction in Relational Semantics

Theor. Comput. Sci. • 1991
View 1 Excerpt

On ordered pairs and relations, In Selected Logic Papers

W. V. Quine
Random House, • 1966
View 1 Excerpt

Similar Papers

Loading similar papers…