(Enter summary)
Abstract: We study the impact of adding certain families of
generalized quantifiers to first-order logic (FO) on the
asymptotic behavior of sentences. All our results are
stated and proved for languages disallowing free variables
in the scope of generalized quantifiers. For a
class K of finite structures closed under isomorphism,
the quantifier QK is said to be strongly monotonic,
sm, if membership in the class is preserved under a
loose form of extensions. Our first theorem (0/1 law
for FO with any set... (Update)
Context of citations to this paper: More
...the cardinality of R is bigger than the cardinality of S. The asymptotic probability of the above query is 1 2 . The result follows from [FGT93], where it is shown that first order sentences with limited Rescher s quantifiers (expressing cardinality comparison) have asymptotic...
...of first order logic by Lindstrom quantifiers. Such extensions were also considered, from the point of view of 0 1 laws by Fayolle et al. [8], where a sufficient condition was established on a quantifier Q, for a restricted fragment of the logic FO[Q] to have a 0 1 law. We...
Cited by: More
Towards Tractable Algebras for Bags - Grumbach, Milo (1993)
(Correct)
On the Expressive Power of Counting - Grumbach, Tollu (1994)
(Correct)
Generalized Quantifiers and 0-1 Laws - Dawar, Grädel (1995)
(Correct)
Active bibliography (related documents): More All
0.6: Generalized Quantifiers for Simple Properties - Otto (1994)
(Correct)
0.3: Finite-Model Theory - A Personal Perspective - Fagin (1993)
(Correct)
0.2: Inductive Definability with Counting on Finite Structures - Grädel, Otto (1993)
(Correct)
Similar documents based on text: More All
0.3: Linear Constraint Databases (Extended Abstract) - Grumbach, al.
(Correct)
0.2: Monadic Second Order Asymptotics on Random Acyclic Graphs - McColm (2000)
(Correct)
0.2: On Two-Dimensional Markov Chains in the Positive Quadrant with.. - Zachary (1995)
(Correct)
Related documents from co-citation: More All
3: Generic computation and its complexity (context) - Abiteboul, Vianu - 1991
3: infinitary logic in finite-model theory (context) - Kolaitis, Vardi et al. - 1992
3: Inductive definability with counting on finite structures
- Gradel, Otto - 1993
BibTeX entry: (Update)
G. Fayolle, S. Grumbach, and C. Tollu. Asymptotic probabilities of languages with generalized quantifiers. In Proc. IEEE Symp. on Logic in Computer Science, pages 199--207, June 1993. http://citeseer.ist.psu.edu/fayolle94asymptotic.html More
@inproceedings{ fayolle93asymptotic,
author = "Guy Fayolle and Stephane Grumbach and Christophe Tollu",
title = "Asymptotic Probabilities of Languages with Generalized Quantifiers",
booktitle = "Logic in Computer Science",
pages = "199-207",
year = "1993",
url = "citeseer.ist.psu.edu/fayolle94asymptotic.html" }
Citations (may not include all citations):
1749
An introduction to Probability Theory and its Applications (context) - Feller - 1970
283
Random Graphs (context) - Bollobas - 1985
245
Relational queries computable in polynomial time
- Immerman - 1986
114
Generic computation and its complexity (context) - Abiteboul, Vianu - 1991
95
Fixed-point extensions of first order logic (context) - Gurevich, Shelah - 1986
82
Probability Theory (context) - Loeve - 1977
81
Probabilities on finite models (context) - Fagin - 1976
49
Range and degree of realizability of formulas in the restric.. (context) - Glebskii, Kogan et al. - 1969
49
Annals of Pure and Applied Logic (context) - Blass, Gurevich et al. - 1986
46
Finite model theory---a personal perspective
- Fagin - 1990
42
infinitary logic in finite-model theory (context) - Kolaitis, Vardi et al. - 1992
36
laws and decision problems for fragments of secondorder logi.. (context) - Kolaitis, Vardi - 1990
36
Generalized quantifiers and pebble games on finite structure.. (context) - Kolaitis, Vaananen - 1992
34
The decision problem for the probabilities of higherorder pr.. (context) - Kolaitis, Vardi - 1987
32
First order predicate logic with generalized quantifiers (context) - Lindstrom - 1966
29
Perspectives in Mathematical Logic (context) - Barwise, Feferman et al. - 1985
25
a generalization of quantifiers (context) - Mostowski - 1957
21
Logical hierarchies in PTIME (context) - Hella - 1992
20
A zero-one law for logic with a fixed-point operator (context) - Blass, Gurevich et al. - 1985
19
Properties of almost all graphs and complexes (context) - Blass, Harary - 1979
17
Some remarks on infinitely long formulas (context) - Henkin - 1961
13
North-Holland mathematical library (context) - Berge, hypergraphs - 1976
12
laws for infinitary logic (context) - Kolaitis, Vardi - 1990
10
Complexity of the first order theory of almost all structure.. (context) - Grandjean - 1983
6
Query languages with counters (context) - Grumbach, Tollu - 1992
4
Plurality quantification (context) - Rescher - 1962
3
Uber einen Quantifikator mit zwei Wirkungsbereichen (context) - Hartig - 1965
2
Zero-one law for an extension of first-order predicate langu.. (context) - Knyazev - 1990
1
M'ethode de la Th'eorie d'une Fonction d'une Variable Comple.. (context) - Lavrentiev, Shabat - 1977
Documents on the same site (http://cosmos.inria.fr:8080/cgi-bin/publisverso?what=byyear&query=0): More
Design and Implementation of Object-Oriented Views - Santos (1995)
(Correct)
Valmont: a Language for Workflow Programming - Chan, Leung (1998)
(Correct)
Relational Transducers for Electronic Commerce - Abiteboul, Vianu, Fordham, Yesha (1998)
(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