Weak MSO-Reference-Cited by-同舟云学术

Weak MSO

Published:2014-07-14 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
language:
Short-container-title:

Author:

Carreiro Facundo¹,Facchini Alessandro²,Venema Yde¹,Zanasi Fabio³

Affiliation:

1. U. Amsterdam

2. U. Warsaw

3. ENS Lyon, U. Lyon, CNRS, INRIA, UCBL

Funder

European Union from the Regional Development Fund

Agence Nationale de la Recherche

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/2603088.2603101

Reference19 articles.

1. A. Arnold and D. Niwiński . Rudiments of μ-calculus volume 146 of Studies in Logic and the Found . of Mathematics. North-Holland 2001 . A. Arnold and D. Niwiński. Rudiments of μ-calculus volume 146 of Studies in Logic and the Found. of Mathematics . North-Holland 2001.

2. F. Carreiro A. Facchini Y. Venema and F. Zanasi. Weak MSO: Automata and expressiveness modulo bisimilarity. Technical report 2014. URL http://arxiv.org/abs/1401.4374. F. Carreiro A. Facchini Y. Venema and F. Zanasi. Weak MSO: Automata and expressiveness modulo bisimilarity. Technical report 2014. URL http://arxiv.org/abs/1401.4374.

3. Modal characterisation theorems over special classes of frames

4. Tree automata, mu-calculus and determinacy

5. A Characterization Theorem for the Alternation-Free Fragment of the Modal µ-Calculus

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Characterisation Theorem for Two-Way Bisimulation-Invariant Monadic Least Fixpoint Logic Over Finite Structures;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08

2. Quantifying Over Trees in Monadic Second-Order Logic;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26

3. Model theory of monadic predicate logic with the infinity quantifier;Archive for Mathematical Logic;2021-10-27

4. Bisimulation invariant monadic-second order logic in the finite;Theoretical Computer Science;2020-07

5. The Power of the Weak;ACM Transactions on Computational Logic;2020-04-30