Coalgebraic Automata Theory: Basic Results

Autor: Kupke, C., Venema, Y.

Publikováno v: Logical Methods in Computer Science, Volume 4, Issue 4 (November 21, 2008) lmcs:1203

We generalize some of the central results in automata theory to the abstraction level of coalgebras and thus lay out the foundations of a universal theory of automata operating on infinite objects. Let F be any set functor that preserves weak pullbac

Externí odkaz: http://arxiv.org/abs/0811.1976

A Focus System for the Alternation-Free $$\mu $$-Calculus

Autor: Marti, J., Venema, Y., Das, A., Negri, S.

Publikováno v: Lecture Notes in Computer Science ISBN: 9783030860585
TABLEAUX
Automated Reasoning with Analytic Tableaux and Related Methods: 30th International Conference, TABLEAUX 2021, Birmingham, UK, September 6–9, 2021 : proceedings, 371-388
STARTPAGE=371;ENDPAGE=388;TITLE=Automated Reasoning with Analytic Tableaux and Related Methods

We introduce a cut-free sequent calculus for the alternation-free fragment of the modal \(\mu \)-calculus. This system allows both for infinite and for finite, circular proofs and uses a simple focus mechanism to control the unravelling of fixpoints

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::82087322ed32e5897ad13ad35a87878a
https://doi.org/10.1007/978-3-030-86059-2_22

Coalgebraic Geometric Logic

Autor: Bezhanishvili, N., de Groot, J., Venema, Y., Roggenbach, M., Sokolova, A.

Publikováno v: 8th Conference on Algebra and Coalgebra in Computer Science: CALCO 2019, June 3-6, 2019, London, United Kingdom
8th Conference on Algebra and Coalgebra in Computer Science

Using the theory of coalgebra, we introduce a uniform framework for adding modalities to the language of propositional geometric logic. Models for this logic are based on coalgebras for an endofunctor T on some full subcategory of the category Top of

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6484f53434f24688e2be2640097acf57

An expressive completeness theorem for coalgebraic modal µ-calculi

Autor: Enqvist, S., Seifan, F., Venema, Y.

Publikováno v: Logical Methods in Computer Science, 13(2):14. Technischen Universitat Braunschweig

Generalizing standard monadic second-order logic for Kripke models, we introduce monadic second-order logic interpreted over coalgebras for an arbitrary set functor. We then consider invariance under behavioral equivalence of MSO-formulas. More speci

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=narcis______::689c75c635edc4d2f98b396fe67e5e52
https://dare.uva.nl/personal/pure/en/publications/an-expressive-completeness-theorem-for-coalgebraic-modal-calculi(722c3654-d554-43ca-8da8-597a6f5a6897).html

Modal Logic and the Vietoris Functor

Autor: Venema, Y., Vosmaer, J., Bezhanishvili, G.

Publikováno v: Leo Esakia on Duality in Modal and Intuitionistic Logics ISBN: 9789401788595
Leo Esakia on Duality in Modal and Intuitionistic Logics, 119-153
STARTPAGE=119;ENDPAGE=153;TITLE=Leo Esakia on Duality in Modal and Intuitionistic Logics

In [16], Esakia uses the Vietoris topology to give a coalgebra-flavored definition of topological Kripke frames, thus relating the Vietoris topology, modal logic and coalgebra. In this chapter, we sketch some of the thematically related mathematical

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5ddc6961ea36f85156ef3e1cfa99324a
https://doi.org/10.1007/978-94-017-8860-1_6