arXiv subjects

Facundo Carreiro

Publications and source records attributed to Facundo Carreiro.

5 recordsLinked to original sources

arXiv2018

Model Theory of Monadic Predicate Logic with the Infinity Quantifier

This paper establishes model-theoretic properties of $\mathrm{FOE}^{\infty}$, a variation of monadic first-order logic that features the generalised quantifier $\exists^\infty$ (`there are infinitely many'). We provide syntactically defined fragments of $\mathrm{FOE}^{\infty}$ characterising four different semantic properties of $\mathrm{FOE}^{\infty}$-sentences: (1) being monotone and (2) (Scott) continuous in a given set of monadic predicates; (3) having truth preserved under taking submodels or (4) invariant under taking quotients. In each case, we produce an effectively defined map that translates an arbitrary sentence $φ$ to a sentence $φ^{p}$ belonging to the corresponding syntactic fragment, with the property that $φ$ is equivalent to $φ^{p}$ precisely when it has the associated semantic property. Our methodology is first to provide these results in the simpler setting of monadic first-order logic with ($\mathrm{FOE}$) and without ($\mathrm{FO}$) equality, and then move to $\mathrm{FOE}^{\infty}$ by including the generalised quantifier $\exists^\infty$ into the picture. As a corollary of our developments, we obtain that the four semantic properties above are decidable for $\mathrm{FOE}^{\infty}$-sentences. Moreover, our results are directly relevant to the characterisation of automata and expressiveness modulo bisimilirity for variants of monadic second-order logic. This application is developed in a companion paper.

cs.LO↗

arXiv2018

The Power of the Weak

A landmark result in the study of logics for formal verification is Janin & Walukiewicz's theorem, stating that the modal $μ$-calculus ($μ\mathrm{ML}$) is equivalent modulo bisimilarity to standard monadic second-order logic (here abbreviated as $\mathrm{smso}$), over the class of labelled transition systems (LTSs for short). Our work proves two results of the same kind, one for the alternation-free fragment of $μ\mathrm{ML}$ ($μ_D\mathrm{ML}$) and one for weak $\mathrm{mso}$ ($\mathrm{wmso}$). Whereas it was known that $μ_D\mathrm{ML}$ and $\mathrm{wmso}$ are equivalent modulo bisimilarity on binary trees, our analysis shows that the picture radically changes once we reason over arbitrary LTSs. The first theorem that we prove is that, over LTSs, $μ_D\mathrm{ML}$ is equivalent modulo bisimilarity to noetherian $\mathrm{mso}$ ($\mathrm{nmso}$), a newly introduced variant of $\mathrm{smso}$ where second-order quantification ranges over "well-founded" subsets only. Our second theorem starts from $\mathrm{wmso}$, and proves it equivalent modulo bisimilarity to a fragment of $μ_D\mathrm{ML}$ defined by a notion of continuity. Analogously to Janin & Walukiewicz's result, our proofs are automata-theoretic in nature: as another contribution, we introduce classes of parity automata characterising the expressiveness of $\mathrm{wmso}$ and $\mathrm{nmso}$ (on tree models) and of $μ_C\mathrm{ML}$ and $μ_D\mathrm{ML}$ (for all transition systems).

cs.LO↗

arXiv2015

Characterization theorems for PDL and FO(TC)

Our main contributions can be divided in three parts: (1) Fixpoint extensions of first-order logic: we give a precise syntactic and semantic characterization of the relationship between $\mathrm{FO(TC^1)}$ and $\mathrm{FO(LFP)}$; (2) Automata and expressiveness on trees: we introduce a new class of parity automata which, on trees, captures the expressive power of $\mathrm{FO(TC^1)}$ and WCL (weak chain logic). The latter logic is a variant of MSO which quantifies over finite chains; and (3) Expressiveness modulo bisimilarity: we show that PDL is expressively equivalent to the bisimulation-invariant fragment of both $\mathrm{FO(TC^1)}$ and WCL. In particular, point (3) closes the open problems of the bisimulation-invariant characterizations of PDL, $\mathrm{FO(TC^1)}$ and WCL all at once.

cs.LO↗

arXiv2014

Weak MSO: Automata and Expressiveness Modulo Bisimilarity

We prove that the bisimulation-invariant fragment of weak monadic second-order logic (WMSO) is equivalent to the fragment of the modal $μ$-calculus where the application of the least fixpoint operator $μp.φ$ is restricted to formulas $φ$ that are continuous in $p$. Our proof is automata-theoretic in nature; in particular, we introduce a class of automata characterizing the expressive power of WMSO over tree models of arbitrary branching degree. The transition map of these automata is defined in terms of a logic $\mathrm{FOE}_1^\infty$ that is the extension of first-order logic with a generalized quantifier $\exists^\infty$, where $\exists^\infty x. ϕ$ means that there are infinitely many objects satisfying $ϕ$. An important part of our work consists of a model-theoretic analysis of $\mathrm{FOE}_1^\infty$.

cs.LO↗

arXiv2010

Characterization and definability in modal first-order fragments

Model theoretic results such as Characterization and Definability give important information about different logics. It is well known that the proofs of those results for several modal logics have, somehow, the same 'taste'. A general proof for most modal logics below first order is still too ambitious. In this thesis we plan to isolate sufficient conditions for the characterization and definability theorems to hold in a wide range of logics. Along with these conditions we will prove that, whichever logic that meets them, satisfies both theorems. Therefore, one could give an unifying proof for logics with already known results. Moreover, one will be able to prove characterization and definability results for logics that have not yet been investigated. In both cases, it is only needed to check that a logic meets the requirements to automatically derive the desired results.

cs.LO↗