𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a Description of Terminal Coalgebras and Iterative Theories

✍ Scribed by Jiří Adámek

Book ID
108498323
Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
187 KB
Volume
82
Category
Article
ISSN
1571-0661

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Infinite trees and completely iterative
Infinite trees and completely iterative theories: a coalgebraic view
✍ Peter Aczel; Jiřı́ Adámek; Stefan Milius; Jiřı́ Velebil 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 533 KB

Inÿnite trees form a free completely iterative theory over any given signature-this fact, proved by Elgot, Bloom and Tindell, turns out to be a special case of a much more general categorical result exhibited in the present paper. We prove that whenever an endofunctor H of a category has ÿnal coalge

A Coalgebraic View of Infinite Trees and
A Coalgebraic View of Infinite Trees and Iteration
✍ Peter Aczel; Jiří Adámek; Jiří Velebil 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 255 KB

The algebra of infinite trees is, as proved by C. Elgot, completely iterative, i.e., all ideal recursive equations are uniquely solvable. This is proved here to be a general coalgebraic phenomenon: let H be an endofunctor such that for every object X a final coalgebra, T X, of H( )+X exists. Then T

A note on finite termination of iterativ
A note on finite termination of iterative algorithms in mathematical programming
✍ Jinchuan Zhou; Changyu Wang 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 610 KB

Two well-known results on the unified treatment of finite termination of a class of algorithms for solving convex programming problems and for solving variational inequality problems are reconsidered. In particular, some of the underlying assumptions employed in the existing literature are shown to