From modal logic to terminal coalgebras

Theoretical Computer Science

Volumn 260, Issue 1-2, 2001, Pages 209-228

  Röiger, Martin ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Coalgebra; Final coalgebra; Modal logic; Polynomial functor; Terminal coalgebra

Indexed keywords

COMPUTATIONAL COMPLEXITY; MODAL ANALYSIS; POLYNOMIALS;

AXIOMATIZATION; TERMINAL COALGEBRAS;

BOOLEAN ALGEBRA;

EID: 0034928008     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00128-6     Document Type: Article

References (21)

1. A final coalgebra theorem
2. Terminal coalgebras in well-founded set theory
3. Vicious circles: On the mathematics of non-wellfounded phenomena
4. A complete calculus for equational deduction in coalgebraic specification
5. Logics of time and computation
6. Mathematics of modality
7. On observing nondeterminism and concurrency
8. Defining equations in terminal coalgebras
9. Mongruences and cofree coalgebras
10. Objects and classes, co-algebraically
11. A tutorial on (co)algebras and (co)induction
12. Specifying coalgebras with modal logic
13. Coalgebraic logic
14. A fixedpoint approach to (co)inductive and (co)datatype definitions
15. An approach to object semantics based on terminal co-algebras
16. Universal coalgebra: A theory of systems
17. On the foundations of final semantics: Non-standard sets, metric spaces, partial orders
18. Initial algebra and final coalgebra semantics for concurrency