Non-well-founded trees in categories

Details Non-well-founded trees in categories Non-well-founded trees in categories

2004-09-09

arxiv.org/abs/math/0409158v1

Mathematics

Category Theory

Submitted for publication

Scientific paper

Non-well-founded trees are used in mathematics and computer science, for modelling non-well-founded sets, as well as non-terminating processes or infinite data-structures. Categorically, they arise as final coalgebras for polynomial endofunctors, which we call M-types. In order to reason about trees, we need the notion of path, which can be formalised in the internal logic of any locally cartesian closed pretopos with a natural number object. In such categories, we derive existence results about M-types, leading to stability of locally cartesian closed pretoposes with a natural number object and M-types under slicing, formation of coalgebras (for a cartesian comonad), and sheaves for an internal site.

Affiliated with

Also associated with

No associations

Rating

Non-well-founded trees in categories 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 Non-well-founded trees in categories, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Non-well-founded trees in categories will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-229574