A Concrete Final Coalgebra Theorem for ZF Set Theory

Computer Science – Logic in Computer Science

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

a greatly revised version has appeared in Mathematical Structures in Computer Science 9 (1999), 545-567. This version uses dif

Scientific paper

A special final coalgebra theorem, in the style of Aczel's, 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. 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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A Concrete Final Coalgebra Theorem for ZF Set Theory does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Concrete Final Coalgebra Theorem for ZF Set Theory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Concrete Final Coalgebra Theorem for ZF Set Theory will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-418196

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.