哲学杂志철학 학술지哲学のジャーナルEast Asian
Journal of
Philosophy

Home > Book Series > Edited Book > Contribution

Publication details

Publisher: Springer

Place: Berlin

Year: 2006

Pages: 420-448

Series: Lecture Notes in Computer Science

ISBN (Hardback): 9783540354628

Full citation:

Lawrence S. Moss, "Uniform functors on sets", in: Algebra, meaning, and computation, Berlin, Springer, 2006

Abstract

This paper studies uniformity conditions for endofunctors on sets following Aczel [1], Turi [21], and others. The "usual" functors on sets are uniform in our sense, and assuming the Anti-Foundation Axiom AFA, a uniform functor H has the property that its greatest fixed point H * is a final coalgebra whose structure is the identity map. We propose a notion of uniformity whose definition involves notions from recent work in coalgebraic recursion theory: completely iterative monads and completely iterative algebras (cias). Among our new results is one which states that for a uniform H, the entire set-theoretic universe V is a cia: the structure is the inclusion of HV into the universe V itself.

Publication details

Publisher: Springer

Place: Berlin

Year: 2006

Pages: 420-448

Series: Lecture Notes in Computer Science

ISBN (Hardback): 9783540354628

Full citation:

Lawrence S. Moss, "Uniform functors on sets", in: Algebra, meaning, and computation, Berlin, Springer, 2006