A Concrete Final Coalgebra Theorem for ZF Set Theory
نویسنده
چکیده
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 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 [10]. ? Thomas Forster alerted me to Quine’s work. Peter Aczel and Andrew Pitts offered considerable advice and help. Daniele Turi gave advice by electronic mail. I have used Paul Taylor’s macros for commuting diagrams. K. Mukai commented on the text. Research funded by the ESPRIT Basic Research Action 6453 ‘Types.’
منابع مشابه
Final coalgebras as greatest fixed points in ZF set theory
A special final coalgebra theorem, in the style of Aczel (1988), 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 lemma...
متن کاملHarsanyi Type Spaces and Final Coalgebras Constructed from Satisfied Theories
This paper connects coalgebra with a long discussion in the foundations of game theory on the modeling of type spaces. We argue that type spaces are coalgebras, that universal type spaces are final coalgebras, and that the modal logics already proposed in the economic theory literature are closely related to those in recent work in coalgebraic modal logic. In the other direction, the categories...
متن کاملModels of non-well-founded sets via an indexed final coalgebra theorem
The paper uses the formalism of indexed categories to recover the proof of a standard final coalgebra theorem, thus showing existence of final coalgebras for a special class of functors on categories with finite limits and colimits. This is then put to use in the context of a Heyting pretopos with a class of small maps, in order to build the final coalgebra for the Ps functor. This is then prov...
متن کاملPower-Set Functors and Saturated Trees
We combine ideas coming from several fields, including modal logic, coalgebra, and set theory. Modally saturated trees were introduced by K. Fine in 1975. We give a new purely combinatorial formulation of modally saturated trees, and we prove that they form the limit of the final ωopchain of the finite power-set functor Pf . From that, we derive an alternative proof of J. Worrell’s description ...
متن کاملA comparison of HOL-ST and Isabelle/ZF
The use of higher order logic simple type theory is often limited by its restrictive type system Set theory allows many constructions on sets that are not possible on types in higher order logic This paper presents a comparison of two theorem provers supporting set theory namely HOL ST and Isabelle ZF based on a formalization of the inverse limit construction of domain theory this construction ...
متن کامل