OUP > Journals > Computing/Engineer. & Mathematics/Stats. > Journal of Logic and Computation
Journal of Logic and Computation
Volume 13, Issue 2, April 2003: pp. 273285
On Almost Sure Elimination of Numerical Quantifiers
Risto Kaila^{1}
^{1}Department of Mathematics, University of Helsinki, P.O. Box 4, 00014 University of Helsinki, Finland. Email: risto.kaila@helsinki.fi
A criterion is given for a collection Q of simple numerical quantifiers such that the logic L_{[infin][ohgr]}^{[ohgr]}(Q) has almost sure quantifier elimination and the zeroone law for some sequences of probability measures of finite structures. For instance, the results can be applied to random graphs with a constant, or sufficiently smooth, edge probability.
Keywords: Zeroone laws; quantifier elimination; Lindström quantifiers; infinitary logics
Table of Contents
FullText PDF (176 KB)
