An institutional approach to positive coalgebraic logic
暂无分享,去创建一个
[1] Dirk Pattinson. Translating Logics for Coalgebras , 2002, WADT.
[2] Alexander Kurz,et al. Quasivarieties and varieties of ordered algebras: regularity and exactness † , 2016, Mathematical Structures in Computer Science.
[3] Samson Abramsky,et al. A Cook's Tour of the Finitary Non-Well-Founded Sets , 2011, We Will Show Them!.
[4] Jean-Eric Pin,et al. Infinite words - automata, semigroups, logic and games , 2004, Pure and applied mathematics series.
[5] Alessandra Palmigiano,et al. A coalgebraic view on positive modal logic , 2004, Theor. Comput. Sci..
[6] Jiří Adámek,et al. Free algebras and automata realizations in the language of categories , 1974 .
[7] Petros S. Stefaneas,et al. Logical support for modularisation , 1993 .
[8] Alexander Kurz,et al. Modalities in the Stone age: A comparison of coalgebraic logics , 2012, Theor. Comput. Sci..
[9] Lutz Schröder,et al. Expressivity of coalgebraic modal logic: The limits and beyond , 2008, Theor. Comput. Sci..
[10] Alexander Kurz,et al. Algebraic Semantics for Coalgebraic Logics , 2004, CMCS.
[11] Razvan Diaconescu,et al. Extra Theory Morphisms for Institutions: Logical Semantics for Multi-Paradigm Languages , 1997, Appl. Categorical Struct..
[12] Grigore Rosu,et al. Institution Morphisms , 2013, Formal Aspects of Computing.
[13] Corina Cıˆrstea. An Institution of Modal Logics for Coalgebras , 2006 .
[14] Glynn Winskel,et al. On Powerdomains and Modality , 1985, Theor. Comput. Sci..
[15] S. Lane. Categories for the Working Mathematician , 1971 .
[16] Filippo Bonchi,et al. Bialgebraic Semantics for Logic Programming , 2015, Log. Methods Comput. Sci..
[17] Alexander Kurz,et al. Finitary Functors: From Set to Preord and Poset , 2011, CALCO.
[18] Alexander Kurz,et al. Enriched Logical Connections , 2011, Applied Categorical Structures.
[19] Alexander Kurz,et al. Relation Liftings on Preorders and Posets , 2011, CALCO.
[20] Dirk Pattinson,et al. Coalgebraic modal logic: soundness, completeness and decidability of local consequence , 2003, Theor. Comput. Sci..
[21] Isar Stubbe,et al. 'Hausdorff distance' via conical cocompletion , 2009 .
[22] Donald Sannella,et al. Foundations of Algebraic Specification and Formal Software Development , 2012, Monographs in Theoretical Computer Science. An EATCS Series.
[23] J. Michael Dunn,et al. Positive modal logic , 1995, Stud Logica.
[24] Walter Tholen,et al. On the categorical meaning of Hausdorff and Gromov distances, I , 2009, 0901.0618.
[25] Alexander Kurz,et al. Equational presentations of functors and monads , 2011, Mathematical Structures in Computer Science.
[26] Alexander Kurz,et al. Positive Fragments of Coalgebraic Logics , 2013, CALCO.
[27] Joseph A. Goguen,et al. Institutions: abstract model theory for specification and programming , 1992, JACM.
[28] Alexander Kurz,et al. Expressiveness of Positive Coalgebraic Logic , 2012, Advances in Modal Logic.