Fragments of existential second-order logic without 0-1 laws

Proceedings - Symposium on Logic in Computer Science

Volumn 1998-June, Issue , 1998, Pages 525-536

  Le Bars, Jean Marie ^a  

^a UNIVERSITÉ DE CAEN   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

ASYMPTOTIC PROBABILITIES; EXISTENTIAL SECOND-ORDER LOGIC; FIRST ORDER;

COMPUTER CIRCUITS;

EID: 82755192577     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.1998.705685     Document Type: Conference Paper

References (21)

1. B. Bollobas. Graph Theory, An Introduction Course. Springer-Verlag, 1979.
2. B. Bollobas. Random Graphs. Academic Press, 1985.
3. B. Bollobas and P. Erdos. Cliques in random graphs. Math. Proc. Cambridge Philos. Soc., 80:419-427, 1976.
4. V. Chvatal. On the computational complexity of finding a kernel. Technical report, Report NO CRM-300, univ. de Montreal, 1973. Centre de Recherches Mathematiques.
5. D. Dreben and W. D. Goldfarb. The Decision Problem: Solvable Classes of Quantificational Formulas. Addison-Wesley, 1979.
6. P. Erdos and A. Renyi. On the evolution of random graphs. Pupl. Math. Inst. Hungar. Acad. Set., 7:17-61, 1960.
7. P. Erdos and J. Spencer. Probabilistic Method in Combinatorics. A Series of Monographs and Textbooks. Academic Press, 1974.
8. R. Fagin. Generalized first-order spectra and polynomial time recognizable sets. In R. Karp, editor, Complexity of Computations, volume 7 of SIAM-AMS Proceedings, pages 43-73, Providence, RI, 1974. American Mathematical Society.
9. R. Fagin. Probabilities on finite models. Journal of Symbolic Logic, 41:50-58, 1976.
10. J. Flum. Problems in Finite Model Theory collected in Oberwolfach. 1994.
11. Y.V. Glebskii, D.I. Kogan, M. I. Liogonki, and V. A. Talanov. Range and degree of re-Alizability of formulas in the restricted predicate calculus. Cybernetics, 5:142-154, 1969.
12. W. D. Goldfarb. The model class with identity is unsolvable. Bulletin of the American Mathematical Society, 10(1): 113-115, January 1984.
13. M. Kaufmann. Counterexample to the 01 law for existential monadic second-order logic. Technical report, CLI Internal Note 32, Computational Logic Inc., December 1987.
14. Ph. G. Kolaitis and M.Y. Vardi. The decision problem for the probabilities of higher-order properties. In Proc. 19th ACMSymp. on Theory of computing, STOC'87, pages 425-435, 1987.
15. Ph. G. Kolaitis and M.Y. Vardi. 0-1 laws and decisions problems for fragments of second- order logic. Information and Computation, 87:302-338, 1990.
16. Ph. G. Kolaitis and M.Y. Vardi. 0-1 laws for fragments of second-order logic: on overview. In Logic from computer science (Proc. of Workshop, 1989), pages 265-286. Y. N. Moschovakis, 1992.
17. M. Mortimer. On languages with two variables. Zeischr.f. math. Logik u. Grundlagen d. Math., 21:135-140, 1975.
18. E. M. Palmer. Graphical Evolution: An Introduction to the Theory of Random Graphs. Wiley, 1985.
19. L. Pacholski and W. Szwast. A counterexample to the 0-1 law for the class of existential second-order minimal Godel sentences with equality. Information and Computation, 107:91-103, 1993.
20. A. Vedo. Asymptotic probabilities for second- order existential Kahr-Moore-Wang sentences. The Journal of Symbolic Logic, 62:304-319, March 1997.
21. W. Fernandez De La Vega. Kernel on random graphs. Discrete Mathematics, 82:213217, 1990.