0-1 Law fails for monadic existential second-order logic on undirected graphs

Information Processing Letters

Volumn 77, Issue 1, 2001, Pages 43-48

  Le Bars, Jean Marie ^a  

^a UNIVERSITÉ DE CAEN   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY SEQUENCES; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; PROBLEM SOLVING;

MONADIC EXISTENTIAL SECOND-ORDER LOGICS; UNDIRECTED GRAPHS;

FORMAL LOGIC;

EID: 0035147974     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(00)00149-6     Document Type: Article

References (10)

1. Fagin R. Probabilities on finite models. J. Symbolic Logic. Vol. 41:1976;50-58.
2. Glebskii Y.V., Kogan D.I., Liogonki M.I., Talanov V.A. Range and degree of realizability of formulas in the restricted predicate calculus. Cybernetics. Vol. 5:1969;142-154.
3. Kaufmann M. Counterexample to the 0-1 law for existential monadic second-order logic. Technical Report, CLI Internal Note 32:December 1987;Computational Logic Inc.
4. Kaufmann M., Shelah S. On random models of finite power and monadic logic. Discrete Math. Vol. 54:1985;285-293.
5. Kolaitis P.G., Vardi M.Y. The decision problem for the probabilities of higher-order properties. Proc. 19th ACM Symp. on Theory of Computing, STOC'87. 1987;425-435.
6. Kolaitis P.G., Vardi M.Y. 0-1 laws and decisions problems for fragments of second-order logic. Inform. and Comput. Vol. 87:1990;302-338.
7. Le Bars J.-M. Fragments of existential second-order logic without 0-1 laws. Proceedings of the 13th IEEE Symposium on Logic in Computer Science. 1998.
8. Le Bars J.-M. Probabilités Asymptotiques et Pouvoir d'Expression des Fragments de la Logique du Second Ordre. Ph.D. Thesis:1998;University of Caen.
9. Le Bars J.-M. Counterexamples of the 0-1 law for fragments of existential second-order logic: an overview. Bull. Symbolic Logic. Vol. 9:2000;67-82.
10. Pacholski L., Szwast W. A counterexample to the 0-1 law for the class of existential second-order minimal Gödel sentences with equality. Inform. and Comput. Vol. 107:1993;91-103.