0-1 Laws for fragments of existential second-order logic: A survey

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1893, Issue , 2000, Pages 84-98

  Kolaitis, Phokion G ^a   Vardi, Moshe Y ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b RICE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; PROBABILITY; RECONFIGURABLE HARDWARE; SURVEYS;

DECISION PROBLEMS; EXISTENTIAL SECOND-ORDER LOGIC; FINITE RELATIONAL STRUCTURES; FINITE SATISFIABILITY; FIRST ORDER; FIRST ORDER LOGIC; FIRST-ORDER LOGIC WITH EQUALITY;

COMPUTER CIRCUITS;

EID: 84959193552     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44612-5_6     Document Type: Conference Paper

References (40)

1. Abiteboul, S, Hull, R., Vianu, V.: Foundations of Databases. Addision-Wesley, 1995.
2. Abramson, F.D., Harrington, L.A.: Models without indiscernibles. J. Symbolic Logic 43(1978),pp. 572-600.
3. Borger, E., Gradel, E., Gurevich, Y.: The Classical Decision Problem. Springer-Verlag, 1997.
4. Bollobas, B: Random Graphs. Academic Press, 1985
5. Chernoff, H.: A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the Sum of Observation. Ann. Math. Stat. 23(1952), pp. 493-509.
6. Chandra, A., Kozen, D., Stockmeyer, L.: Alternation. J. ACM 28(1981), pp. 114-133.
7. Compton, K.J.: 0-1 laws in logic and combinatorics, in NATO Adv. Study Inst. on Algorithms and Order (I. Rival, ed.), D. Reidel, 1988, pp. 353-383.
8. de la Vega, W.F.: Kernel on random graphs. Discrete Mathematics 82(1990), pp. 213-217.
9. Dreben, D., and Goldfarb, W.D.: The Decision Problem: Solvable Classes ofQuantificational Formulas. Addison-Wesley,1979.
10. Ebbinghaus, H.D., Flum, J.: Finite Model Theorey, Springer-Verlag, 1995.
11. Fagin, R.: Generalized first-order spectra and polynomial time recognizable sets. Complexity of Computations (R. Karp, ed.), SIAM-AMS Proc. 7(1974), pp.43-73.
12. Fagin, R.: Probabilities on finite models. J. Symbolic Logic 41(1976), pp. 50-58.
13. Gaifman, H.: Concerning measures in first-order calculi. Israel J. Math. 2(1964). pp. 1-18.
14. Glebskii, Y.V., Kogan, D.I., Liogonkii M.I., Talanov, V.A.: Range and degree of realizability of formulas in the restricted predicate calculus. Cybernetics 5(1969), pp. 142-154.
15. Godel, K.: Ein Spezialfall des Entscheidungsproblems der theoretischen Logik, Ergebn. math. Kolloq. 2(1932), pp. 27-28.
16. Goldfarb, W.D.: The Godel class with equality is unsolvable. Bull. Amer. Math. Soc. (New Series) 10(1984), pp. 113-115.
17. Grandjean, E.: Complexity of the first-order theory of almost all structures. Information and Control 52(1983), pp. 180-204.
18. Gradel, E., Kolaitis P.G., Vardi M.Y.: On the decision problem for two-variable first-order logic. Bulletin of Symbolic Logic 3(1997), 53-69.
19. Gurevich, Y., and Shelah, S.: Random models and the Godel case of the decision problem. J. of Symbolic Logic 48(1983), pp. 1120-1124.
20. Hartmanis, J., Immerman, N., Sewelson, J.: Sparse sets in NP-P - EXPTIME vs. NEXPTIME. Information and Control 65(1985), pp. 159-181.
21. Immerman, N.: Desctiptive Complexity. Springger-Verlag, 1998.
22. Kaufmann, M.: A counterexample to the 0-1 law for existential monadic second-order logic. CLI Internal Note 32, Computational Logic Inc., Dec. 1987.
23. Kauffman, M., Shelah, S: On random models of finite power and monadic logic. Discrete Mathematics 54(1985), pp. 285-293.
24. Kolaitis, P., Vardi, M.Y.: The decision problem for the probabilities of higher-order properties. Proc. 19th ACM Symp. on Theory of Computing, New York, May 1987, pp. 425-435.
25. Kolaitis, P.G., Vardi, M.Y.: 0-1 laws for fragments of second-order logic - an overview. Logic from Computer Science (Proc. of Workshop, 1989), 1992, pp. 265-286.
26. Kolaitis, P., Vardi, M.Y.: 0-1 laws and decision problems for fragments of second-order logic. Information and Computation 87(1990), pp. 302-338.
27. Lacoste: Finitistic proofs of 0-1 laws for fragments of second-order logic. Information Processing Letters 58(1996), pp. 1-4.
28. Lacoste, T.: 0-1 Laws by preservation. Theoretical Computer Science 184(1997), pp. 237-245.
29. Le Bars, J.M.: Fragments of existential second-order logic without 0-1 laws. Proc. 13th IEEE Symp. on Logic in Computer Science, 1998, pp. 525-536.
30. Le Bars, J.M.: Counterexamples of the 0-1 law for fragments of existential second-order logic: an overview. Bulletin ofSymbolic Logic 6(2000), pp. 67-82.
31. Mortimer, M.: On language with two variables, Zeit. fur Math. Logik und Grund. derMath. 21(1975), pp. 135-140.
32. Nešetfil, J., Rodl, V.: Partitions of finite relational and set systems. J. Combinatorial Theory A 22(1977), pp. 289-312.
33. Nefetril, J., Rodl, V.: Ramsey classes of set systems. J. Combinatorial Theory A 34(1983), pp. 183-201.
34. Posa, L.: Hamiltonian circuits in random graphs. Discrete Math. 14(1976), pp. 359-364.
35. Pacholski, L., Szwast, L.: Asymptotic probabilities of existential second-order Godel sentences. Journal of Symbolic Logic 56(1991), pp. 427-438.
36. Pacholski, L., Szwast, W.: A counterexample to the 0-1 law for the class of existential second-order minimal Godel sentences with equality. Information and Computation 107(1993), pp. 91-103.
37. Ramsey, F.P.: On a problem in formal logic. Proc. London Math. Soc. 30(1928). pp. 264-286.
38. Trakhtenbrot, B.A.: The impossibilty of an algorithm for the decision problem for finite models. Doklady Akademii Nauk SSR 70(1950), PP. 569-572.
39. Tendera, L.: A note on asymptotic probabilities of existential second-order minimal classes: the last step. Fundamenta Informaticae 20(1994), pp. 277-285.
40. Vedo, A.: Asymptotic probabilities for second-order existential Kahr-Moore-Wang sentences. J. Symbolic Logic 62(1997), pp. 304-319.