Finitistic proofs of 0-1 laws for fragments of second-order logic

Information Processing Letters

Volumn 58, Issue 1, 1996, Pages 1-4

  Lacoste, Thierry ^a  

^a CNRS   (France)

Author keywords

Asymptotic probabilities in logic; Combinatorial problems; Finitistic methods

Indexed keywords

EID: 0038702390     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(96)00035-X     Document Type: Article

References (5)

1. R. Fagin, Probabilities on finite models, J. Symbolic Logic 41 (1976) 50-58.
2. Y.V. Glebskii, D.I. Kogan, M.I. Liogonki and V.A. Talanov, Range and degree of realizability of formulas in the restricted predicate calculus, Cybernetics 5 (1969) 142-154.
3. P.G. Kolaitis and M.Y. Vardi, The decision problem for the probabilities of higher-order properties, in: Proceedings 19th ACM Symposium on Theory of Computing, New York (1987) 425-435.
4. P.G. Kolaitis and M.Y. Vardi, 0-1 laws and decision problems for fragments of second-order logic, Inform. Comput. 87 (1990) 302-338.
5. P.G. Kolaitis and M.Y. Vardi, 0-1 laws for fragments of second-order logic: an overview, in: Y.N. Moschovakis, ed., Logic from Computer Science, (Proceedings of Workshop, 1989) (1992) 265-286.