0-1 laws by preservation

Theoretical Computer Science

Volumn 184, Issue 1-2, 1997, Pages 237-245

  Lacoste, Thierry ^a  

^a CNRS   (France)

Author keywords

Asymptotic probabilities in logic; Computational complexity

Indexed keywords

COMPUTATIONAL COMPLEXITY; FORMAL LANGUAGES; MATHEMATICAL MODELS; POLYNOMIALS; PROBABILITY;

ASYMPTOTIC PROBABILITY;

FORMAL LOGIC;

EID: 0031222928     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00086-8     Document Type: Article

References (11)

1. K.J. Compton, 0-1 laws in logic and combinatorics, in: I. Rival, (Ed.), NATO Adv. Study Inst. on Algorithms and Order, D. Reidel, Dordrecht, 1988, pp. 353-383.
2. R. Fagin, Generalized first-order spectra and polynomial-time recognizable sets, in: R.M. Karp, (Ed.), Complexity of Computation, SIAM-AMS Proc., vol. 7, 1974, pp. 43-73.
3. R. Fagin, Probabilities on finite models, J. Symbolic Logic 41 (1976) 50-58.
4. R. Fagin, Finite-model theory - a personal perspective, Theoret. Comput. Sci. 116 (1993) 3-31.
5. Y.V. Glebskii, D.I. Kogan, M.I. Liogonki, V.A. Talanov, Range and degree of realizability of formulas in the restricted predicate calculus, Cybernetics 5 (1969) 142-154.
6. Y. Gurevich, Zero-one laws: the logic in computer science column, Bull. Europ. Assoc. Theoret. Comput. Sci. 46 (1992) 90-106.
7. Ph. Kolaitis, M. Vardi, The decision problem for the probabilities of higher-order properties, in: Proc. 19th ACM Symp. on Theory of Computing, 1987 pp. 425-435.
8. Ph. Kolaitis, M. Vardi, 0-1 laws and decision problems for fragments of second-order logic, Inform. Comput. 87 (1990) 302-338.
9. Ph. Kolaitis, M. Vardi, Infinitary logics and 0-1 laws, Inform. Comput. 98 (1992) 258-294.
10. T. Lacoste, Convergence laws and 0-1 laws in random finite structures: a logical and finitistic approach, Ph.D. Thesis, Université Paris 7, 1996.
11. L.J. Stockmeyer, The polynomial-time hierarchy, Theoret. Comput. Sci. 3 (1977) 1-22.