Skip Navigation

Journal of Logic and Computation 2003 13(2):273-285; doi:10.1093/logcom/13.2.273
© 2003 by Oxford University Press
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Kaila, R.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Original Article

On Almost Sure Elimination of Numerical Quantifiers

Risto Kaila1

1 Department of Mathematics, University of Helsinki, P.O. Box 4, 00014 University of Helsinki, Finland. E-mail: risto.kaila{at}helsinki.fi

A criterion is given for a collection Q of simple numerical quantifiers such that the logic L{infty}{omega}{omega}(Q) has almost sure quantifier elimination and the zero-one 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: Zero-one laws; quantifier elimination; Lindström quantifiers; infinitary logics

Received 12 April 2001.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.