| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
Asymptotic probabilities of languages with generalized quantifiers
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 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.
https://hal.inria.fr/inria-00077192
Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Monday, May 29, 2006 - 5:16:43 PM
Last modification on : Friday, February 4, 2022 - 3:08:04 AM
Long-term archiving on: : Friday, May 13, 2011 - 10:49:58 PM
Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Monday, May 29, 2006 - 5:16:43 PM
Last modification on : Friday, February 4, 2022 - 3:08:04 AM
Long-term archiving on: : Friday, May 13, 2011 - 10:49:58 PM