We consider existential monadic second-order sentences ∃X φ(X) about undirected graphs, where ∃X is a finite sequence of monadic quantifiers and φ(X) ∈ +∞ω ω is an infinite first-order formula. We prove that there exists a sentence (in the considered logic) with two monadic variables and two first-order variables such that the probability that it is true on G(n, p) does not converge. Moreover, such an example is also obtained for one monadic variable and three first-order variables. © 2017, Pleiades Publishing, Ltd
This paper presents a complete axiomatization of Monadic Second-Order Logic (MSO) over infinite tree...
This paper presents a complete axiomatization of Monadic Second-Order Logic (MSO) over infinite tree...
AbstractThe probability of a property on the collection of all finite relational structures is the l...
We consider existential monadic second-order sentences ∃X φ(X) about undirected graphs, where ∃X is ...
AbstractThe probability of a property on the collection of all finite relational structures is the l...
. We show that every formula of the existential fragment of monadic second-order logic over picture ...
AbstractFor any property θ of a model (or graph), let μn(θ) be the fraction of models of power n whi...
AbstractThis paper considers the definability of graph-properties by restricted second-order and fir...
AbstractIt is a well-known result of Fagin that the complexity class NP coincides with the class of ...
AbstractIt is a well-known result of Fagin that the complexity class NP coincides with the class of ...
Monadic second order logic and linear temporal logic are two logical formalisms that can be used to ...
As is well-known a language of finite words, considered as labeled linear orders, is defin-able in m...
AbstractIt is a well-known result of Fagin that the complexity class NP coincides with the class of ...
We show that the monadic second-order quantifier alternation hierarchy over finite directed graphs a...
AbstractThis paper considers the definability of graph-properties by restricted second-order and fir...
This paper presents a complete axiomatization of Monadic Second-Order Logic (MSO) over infinite tree...
This paper presents a complete axiomatization of Monadic Second-Order Logic (MSO) over infinite tree...
AbstractThe probability of a property on the collection of all finite relational structures is the l...
We consider existential monadic second-order sentences ∃X φ(X) about undirected graphs, where ∃X is ...
AbstractThe probability of a property on the collection of all finite relational structures is the l...
. We show that every formula of the existential fragment of monadic second-order logic over picture ...
AbstractFor any property θ of a model (or graph), let μn(θ) be the fraction of models of power n whi...
AbstractThis paper considers the definability of graph-properties by restricted second-order and fir...
AbstractIt is a well-known result of Fagin that the complexity class NP coincides with the class of ...
AbstractIt is a well-known result of Fagin that the complexity class NP coincides with the class of ...
Monadic second order logic and linear temporal logic are two logical formalisms that can be used to ...
As is well-known a language of finite words, considered as labeled linear orders, is defin-able in m...
AbstractIt is a well-known result of Fagin that the complexity class NP coincides with the class of ...
We show that the monadic second-order quantifier alternation hierarchy over finite directed graphs a...
AbstractThis paper considers the definability of graph-properties by restricted second-order and fir...
This paper presents a complete axiomatization of Monadic Second-Order Logic (MSO) over infinite tree...
This paper presents a complete axiomatization of Monadic Second-Order Logic (MSO) over infinite tree...
AbstractThe probability of a property on the collection of all finite relational structures is the l...