Non-well-founded trees in categories
From MaRDI portal
Publication:876383
DOI10.1016/j.apal.2006.12.001zbMath1166.03042arXivmath/0409158OpenAlexW2032698723MaRDI QIDQ876383
Benno van den Berg, Federico De Marchi
Publication date: 18 April 2007
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0409158
final coalgebrassheavesMartin-Löf type theoryconstructive set theorycategorical logicnon-well-founded structures
Related Items
Non-deterministic inductive definitions, Unnamed Item, Unnamed Item, W-types in homotopy type theory, The graph conception of set, Containers: Constructing strictly positive types
Cites Work
- Inductive types and exact completion
- Fundamental properties of infinite trees
- Wellfounded trees in categories
- Containers: Constructing strictly positive types
- On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces
- Models of non-well-founded sets via an indexed final coalgebra theorem
- Algebra and Coalgebra in Computer Science
- Subequalizers
- Types for Proofs and Programs
- The axiom of choice
- On the structure of categories of coalgebras
- Type theories, toposes and constructive set theory: Predicative aspects of AST
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item