Title
Asymptotic Probabilities of Languages with Generalized Quantifiers
Abstract
We study the impact of adding certain families ofgeneralized quantifiers to first-order logic (FO) on theasymptotic behavior of sentences. All our results arestated and proved for languages disallowing free variablesin the scope of generalized quantifiers. For aclass 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 aloose form of extensions. Our first theorem (0/1 lawfor FO with any set...
Year
DOI
Venue
1993
10.1109/LICS.1993.287587
LICS
Keywords
Field
DocType
formal logic,graph theory,probability,query languages,theorem proving,Hartig quantifiers,Rescher quantifiers,asymptotic probabilities,cardinality inequality,equicardinality quantifiers,finite structures,first-order logic,free variables,generalized quantifiers,isomorphism,limit law,quantifier,query languages,sentence asymptotic behavior,strongly monotonic,syntactic restriction,upper bound
Bounded quantifier,Discrete mathematics,Monotonic function,Combinatorics,Free variables and bound variables,Upper and lower bounds,Cardinality,First-order logic,Isomorphism,Asymptotic analysis,Mathematics
Conference
ISSN
Citations 
PageRank 
1043-6871
5
1.42
References 
Authors
16
3
Name
Order
Citations
PageRank
Guy Fayolle119694.17
Stephane GRUMBACH21375675.46
Christophe Tollu312657.12