Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Sebastian Enqvist"'
Autor:
Sebastian Enqvist, Yde Venema
Publikováno v:
Logical Methods in Computer Science, Vol Volume 15, Issue 1 (2022)
We present the concept of a disjunctive basis as a generic framework for normal forms in modal logic based on coalgebra. Disjunctive bases were defined in previous work on completeness for modal fixpoint logics, where they played a central role in th
Externí odkaz:
https://doaj.org/article/b494e59af076458e828fa1ecc6213c5e
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 251, Iss Proc. TARK 2017, Pp 57-74 (2017)
We revisit the crucial issue of natural game equivalences, and semantics of game logics based on these. We present reasons for investigating finer concepts of game equivalence than equality of standard powers, though staying short of modal bisimulati
Externí odkaz:
https://doaj.org/article/ac7f0a8fae44498bb19f683709e96957
Publikováno v:
Logical Methods in Computer Science, Vol Volume 13, Issue 2 (2017)
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://doaj.org/article/0fccdd193f5940dcbb19c4e493568138
Publikováno v:
Logic Journal of the IGPL.
We introduce a path-based cyclic proof system for first-order $\mu $-calculus, the extension of first-order logic by second-order quantifiers for least and greatest fixed points of definable monotone functions. We prove soundness of the system and de
Publikováno v:
Studia Logica, 107(4), 719-751. Springer Netherlands
We propose a new perspective on logics of computation by combining instantial neighborhood logic INL with bisimulation safe operations adapted from PDL. INL is a recent modal logic, based on an extended neighborhood semantics which permits quantifica
Publikováno v:
Journal of Philosophical Logic, 48(4), 649-684. Springer Netherlands
We present a new notion of game equivalence that captures basic powers of interacting players. We provide a representation theorem, a complete logic, and a new game algebra for basic powers. In doing so, we establish connections with imperfect inform
Autor:
Sumit Sourabh, Sebastian Enqvist
Publikováno v:
Journal of Logic and Computation, 28(6), 991-1010. Oxford University Press
We introduce and study bisimulations for coalgebras on Stone spaces (Kupke et al., 2004, Theoretical Computer Science, 327, 109–134), motivated by previous work on ultrafilter extensions for coalgebras (Kupke et al., 2005, Algebra and Coalgebra in
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 251, Iss Proc. TARK 2017, Pp 57-74 (2017)
Electronic Proceedings in Theoretical Computer Science, 251, 57-74. Open Publishing Association
Electronic Proceedings in Theoretical Computer Science, 251, 57-74. Open Publishing Association
We revisit the crucial issue of natural game equivalences, and semantics of game logics based on these. We present reasons for investigating finer concepts of game equivalence than equality of standard powers, though staying short of modal bisimulati
Publikováno v:
Review of Symbolic Logic, 10(1), 116-144. Cambridge University Press
This paper explores a new language of neighbourhood structures where existential information can be given about what kind of worlds occur in a neighbourhood of a current world. The resulting system of ‘instantial neighbourhood logic’ INL has a no
Publikováno v:
2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2019): Vancouver, British Columbia, Canada, 24-27 June 2019, 307-319
STARTPAGE=307;ENDPAGE=319;TITLE=2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2019)
LICS
34th ACM/IEEE Symposium on Logic in Computer Science, LICS 2019
2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2019, 2019-June
STARTPAGE=307;ENDPAGE=319;TITLE=2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2019)
LICS
34th ACM/IEEE Symposium on Logic in Computer Science, LICS 2019
2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2019, 2019-June
Game logic was introduced by Rohit Parikh in the 1980s as a generalisation of propositional dynamic logic (PDL) for reasoning about outcomes that players can force in determined 2-player games. Semantically, the generalisation from programs to games
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::55700bc3ee825efbaa0d43b2b81ba3bc
https://doi.org/10.1109/LICS.2019.8785676
https://doi.org/10.1109/LICS.2019.8785676