Facundo Carreiro
Facundo Carreiro
Verified email at google.com - Homepage
Title
Cited by
Cited by
Year
PDL Inside the μ-calculus: a syntactic and an automata-theoretic characterization
F Carreiro, Y Venema
Advances in Modal Logic 10, 74-93, 2014
142014
PDL is the bisimulation-invariant fragment of weak chain logic
F Carreiro
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 341-352, 2015
112015
Weak MSO: Automata and expressiveness modulo bisimilarity
F Carreiro, A Facchini, Y Venema, F Zanasi
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference …, 2014
112014
Fragments of fixpoint logics
F Carreiro
Ph. D. thesis, University of Amsterdam, 2015
92015
The Power of the Weak
F Carreiro, A Facchini, Y Venema, F Zanasi
ACM Transactions on Computational Logic (TOCL) 21 (2), 1-47, 2020
42020
Model theory of monadic predicate logic with the infinity quantifier
F Carreiro, A Facchini, Y Venema, F Zanasi
arXiv preprint arXiv:1809.03262, 2018
32018
Characterization, definability and separation via saturated models
C Areces, F Carreiro, S Figueira
Theoretical Computer Science 537, 72-86, 2014
32014
Coalgebraic announcement logics
F Carreiro, D Gorín, L Schröder
International Colloquium on Automata, Languages, and Programming, 101-112, 2013
32013
Basic model theory for memory logics
C Areces, F Carreiro, S Figueira, S Mera
International Workshop on Logic, Language, Information, and Computation, 20-34, 2011
32011
Characterization and definability in modal first-order fragments
F Carreiro
arXiv preprint arXiv:1011.4718, 2010
22010
Beyond Regularity for Presburger Modal Logic
F Carreiro, S Demri
Advances in Modal Logic, 161-182, 2012
12012
On characterization, definability and ω-saturated models
F Carreiro
International Colloquium on Theoretical Aspects of Computing, 62-76, 2011
12011
The system can't perform the operation now. Try again later.
Articles 1–12