Recursive coalgebras of finitary functors
For finitary set functors preserving inverse images, recursive coalgebras A of Paul Taylor are proved to be precisely those for which the system described by A always halts in finitely many steps.
Page 1
Jiří Adámek, Dominik Lücke, Stefan Milius (2007)
RAIRO - Theoretical Informatics and Applications
For finitary set functors preserving inverse images, recursive coalgebras A of Paul Taylor are proved to be precisely those for which the system described by A always halts in finitely many steps.
Davey, B.A., Knox, B.J. (1999)
Acta Mathematica Universitatis Comenianae. New Series
Vítězslav Novák, Miroslav Novotný (1997)
Czechoslovak Mathematical Journal
Wiesław Dziobiak (1990)
Fundamenta Mathematicae
Ahmad Shafaat (1973)
Archivum Mathematicum
Oldřich Kopeček (1978)
Archivum Mathematicum
Danica Jakubíková-Studenovská (1997)
Czechoslovak Mathematical Journal
Ivan Chajda, Helmut Länger (2000)
Discussiones Mathematicae - General Algebra and Applications
Ring-like operations are introduced in pseudocomplemented semilattices in such a way that in the case of Boolean pseudocomplemented semilattices one obtains the corresponding Boolean ring operations. Properties of these ring-like operations are derived and a characterization of Boolean pseudocomplemented semilattices in terms of these operations is given. Finally, ideals in the ring-like structures are defined and characterized.
Page 1