Results 1 
3 of
3
Expressive Logics for Coalgebras via Terminal Sequence Induction
 Notre Dame J. Formal Logic
, 2002
"... This paper introduces the proof principle of terminal sequence induction and shows, how terminal sequence induction can be used to obtain expressiveness results for logics, interpreted over coalgebras. ..."
Abstract

Cited by 26 (8 self)
 Add to MetaCart
This paper introduces the proof principle of terminal sequence induction and shows, how terminal sequence induction can be used to obtain expressiveness results for logics, interpreted over coalgebras.
Translating Logics for Coalgebras
, 2002
"... This paper shows, that three dierent types of logics for coalgebras are institutions. ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This paper shows, that three dierent types of logics for coalgebras are institutions.
Final Coalgebras
"... That is, makes the diagram C R 1 oo 2 // D TC TR T1 oo T2 // TD 1 commute. We call a pair (c; d) 2 C D bisimilar, if 9R C D. R bisimulation and (c; d) 2 R. If c and d are bisimilar, this is denoted by c  d. 2 On Bisimulation If f : A ! B is a function, denote its Graph b ..."
Abstract
 Add to MetaCart
That is, makes the diagram C R 1 oo 2 // D TC TR T1 oo T2 // TD 1 commute. We call a pair (c; d) 2 C D bisimilar, if 9R C D. R bisimulation and (c; d) 2 R. If c and d are bisimilar, this is denoted by c  d. 2 On Bisimulation If f : A ! B is a function, denote its Graph by G(f) = f(a; f(a)) j a 2<F12.2