Rank-1 modal logics are coalgebraic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4393 LNCS, Issue , 2007, Pages 573-585

  Schröder, Lutz ^a   Pattinson, Dirk ^b  

^a UNIVERSITY OF BREMEN   (Germany)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; DECISION MAKING; MODAL ANALYSIS; SEMANTICS;

COALGEBRAIC MODAL LOGIC; GENERIC DECISION PROCEDURES; SYNTACTIC VERSIONS;

FUZZY LOGIC;

EID: 38049162126     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70918-3_49     Document Type: Conference Paper

References (21)

1. J. Adámek and H.-E. Porst. On tree coalgebras and coalgebra presentations. Theoret. Comput. Sci., 311:257-283, 2004.
2. M. Barr. Terminal coalgebras in well-founded set theory. Theoret. Comput. Sci., 114:299-315, 1993.
3. B. Chellas. Modal Logic. Cambridge, 1980.
4. K. Fine. In so many possible worlds. Notre Dame J. Formal Logic, 13:516-520, 1972.
5. L. Goble. A proposal for dealing with deontic dilemmas. In Deontic Logic in Computer Science, volume 3065 of LNAI, pages 74-113. Springer, 2004.
6. H.-P. Gumm. Functors for coalgebras. Algebra Universalis, 45:135-147, 2001.
7. A. Heifetz and P. Mongin. Probabilistic logic for type spaces. Games and Economic Behavior, 35:31-53, 2001.
8. R. Hilpinen. Deontic logic. In L. Goble, editor, The Blackwell Guide to Philosophical Logic. Blackwell, 2001.
9. B. Jacobs. Towards a duality result in the modal logic of coalgebras. In Coalgebraic Methods in Computer Science, volume 33 of ENTCS. Elsevier, 2000.
10. C. Kupke, A. Kurz, and D. Pattinson. Ultrafilter extensions for coalgebras. In Algebra and Coalgebra in Computer Science, volume 3629 of LNCS, pages 263-277. Springer, 2005.
11. A. Kurz. Specifying coalgebras with modal logic. Theoret. Comput. Sci., 260:119-138, 2001.
12. K. Larsen and A. Skou. Bisimulation through probabilistic testing. Inform. Comput., 94:1-28, 1991.
13. E. Pacuit and S. Salame. Majority logic. In Principles of Knowledge Representation and Reasoning, KR 04, pages 598-605. AAAI Press, 2004.
14. D. Pattinson. Semantical principles in the modal logic of coalgebras. In Theoretical Aspects of Computer Science, STAGS 01, volume 2010 of LNCS, pages 514-526. Springer, 2001.
15. D. Pattinson. Expressive logics for coalgebras via terminal sequence induction. Notre Dame J. Formal Logic, 45:19-33, 2004.
16. M. Pauly. A modal logic for coalitional power in games. J. Logic Comput., 12:149-166, 2002.
17. M. Rößiger. Coalgebras and modal logic. In Coalgebraic Methods in Computer Science, volume 33 of ENTCS. Elsevier, 2000.
18. J. Rutten. Universal coalgebra: A theory of systems. Theoret. Comput. Sci., 249:3-80, 2000.
19. L. Schröder. Expressivity of coalgebraic modal logic: the limits and beyond. In Foundations of Software Science And Computation Structures, volume 3441 of LNCS, pages 440-454. Springer, 2005. Extended version to appear in Theoret. Comput. Sci.
20. L. Schröder. A finite model construction for coalgebraic modal logic. In Foundations Of Software Science And Computation Structures, volume 3921 of LNCS, pages 157-171. Springer, 2006. Extended version to appear in J. Logic Algebraic Programming.
21. L. Schröder and D. Pattinson. PSPACE reasoning for rank-1 modal logics. In Logic in Computer Science, pages 231-240. IEEE, 2006. Presentation slides available under www.informatik.uni-bremen.de/~lschrode/ slides/rank1pspace.pdf.