Logical laws for short existential monadic second-order sentences about graphs
نویسندگان
چکیده
منابع مشابه
Spectra of Monadic Second Order Sentences Sh817
For a monadic sentence ψ in the finite vocabulary we show that the spectra, the set of cardinalities of models of ψ is almost periodic under reasonable conditions. The first is that every model is so called “weakly k-decomposable”. The second is that we restrict ourselves to a nice class of models constructed by some recursion. This research was supported by the Israel Science Foundation I woul...
متن کاملCircle graphs and monadic second-order logic
A circle graph is the intersection graph of a set of chords of a circle. If a circle graph is prime for the split (or join) decomposition defined by Cunnigham, it has a unique representation as a set of intersecting chords, and we prove that this representation can be defined by monadic second-order formulas. By using the (canonical) split decomposition of a circle graph, one can define in mona...
متن کاملFragments of Existential Second-Order Logic without 0-1 Laws
We prove that the digraph property KERNEL has variants K 1 and K 2 for which the asymp-totic probability does not exist. Our proofs draw their inspiration from the study of the clique number of random graphs with constant edge probability. Matula (see Pal85]) and indepen-dantly Erdd os and Bollobb as Bol79] have obtained a theorem which gives the possible values of the clique number. Since the ...
متن کاملA Counterexample to the 0-1 Law for Existential Monadic Second-Order Logic
th For any sentence φ of any logic and any n > 0, one may define the n probability of φ to be the fraction of structure for the vocabulary of φ with universe {0,1,...,n-1} th which satisfy φ. The the limit probability of φ is the limit of the n probability of φ as n goes to infinity, which may or may not exist. Fagin [1] and independently Glebskii, Kogan, Liogon'kii, and Talanov [2] proved that...
متن کاملMonadic Second Order Asymptotics on Random Acyclic Graphs
We classify the vertices of trees, and use a primitive Poisson approximation argument to prove that almost all trees have almost the same proportion of vertices of each kind. We use a graph surgery construction to investigate the asymptotic probabilities of order-invariant Monadic Second Order (with built-in linear ordering) queries over random free trees, proving that for any MSO query , the p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Logic
سال: 2019
ISSN: 0219-0613,1793-6691
DOI: 10.1142/s0219061320500075