(Enter summary)
Abstract: it cannot express a variety of
properties. For example, it follows immediately that evenness is not expressible in FO.
Indeed, n (even) is 1 if n is even and 0 if n is odd. Thus, n (even) does not converge, so
evenness is not expressible in any language that has a 0-1 law.
While 0-1 laws provide an elegant and powerful tool, they require the development of
some non-trivial machinery. Interestingly, this is one of the rare occasions when it is needed
to consider infinite structures while... (Update)
Active bibliography (related documents): More All
0.4: Finite-Model Theory - A Personal Perspective - Fagin (1993)
(Correct)
0.4: More about Recursive Structures: Descriptive Complexity and.. - Hirst, Harel (1996)
(Correct)
0.1: Generalized Quantifiers and 0-1 Laws - Dawar, Grädel (1995)
(Correct)
Similar documents based on text: More All
0.1: JfiCfl.ffi - New York University
(Correct)
0.1: Some Further Notes on Linear Bond Angles - Leslie
(Correct)
0.1: The Closure of Monadic NP - Ajtai, Fagin, Stockmeyer (1997)
(Correct)
BibTeX entry: (Update)
@misc{ here-laws,
author = "We Present Here",
title = "0-1 Laws for FO",
url = "citeseer.ist.psu.edu/359263.html" }
Citations (may not include all citations):
81
Probabilities on finite models (context) - Fagin - 1976
49
Range and degree of realizability of formulas in the restric.. (context) - Glebski, Kogan et al. - 1969
35
Information and Computation (context) - Kolaitis, Vardi et al. - 1992
20
A zero-one law for logic with a fixed point operator (context) - Blass, Gurevich et al. - 1985
16
Universal Graphs and Universal Functions (context) - Rado - 1964
3
The asymptotic truth value of infinite formulas (context) - Talanov, Knyazev - 1984
Documents on the same site (http://www-cse.ucsd.edu/classes/sp99/cse208d/index.html):
Ehrenfeucht-Fraiss'e Games - This Note Presents
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC