Asymptotic probabilities of languages with generalized quantifiers - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 1993

Asymptotic probabilities of languages with generalized quantifiers


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 of sm quantifiers) subsumes a previous criterion for proving that almost no graphs satisfy a given property. We also establish a 0/1 law for FO with Hartig quantifiers (equicardinality quantifiers) and a limit law for a fragment of FO with Rescher quantifiers (expressing inequalities of cardinalities). The proofs of these last two results combine standard combinatorial enumerations with more sophisticated techniques from complex analysis. We also prove that the 0/1 law fails for the extension of FO with Hartig quantifiers if the above syntactic restriction is relaxed. We therefore get the best upper bound for the existence of a 0/1 law for FO with Hartigg quantifiers.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-1916.pdf (581.47 Ko) Télécharger le fichier

Dates and versions

inria-00077192 , version 1 (29-05-2006)



Guy Fayolle, Stéphane Grumbach, Christophe Tollu. Asymptotic probabilities of languages with generalized quantifiers. Eighth Annual IEEE Symposium on Logic in Computer Science, Jun 1993, Montréal / Canada, pp.199-207, ⟨10.1109/LICS.1993.287587⟩. ⟨inria-00077192⟩
127 View
109 Download



Gmail Facebook X LinkedIn More