On probabilistic elimination of generalized quantifiers

DOI10.1002/rsa.1016zbMath0996.03023OpenAlexW2149149024MaRDI QIDQ2748424

Risto Kaila

Publication date: 4 November 2002

Published in: Random Structures and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.1016

zbMATH Keywords

zero-one lawsgeneralized quantifiersalmost sure quantifier eliminationconvergence laws

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Other infinitary logic (03C75) Quantifier elimination, model completeness, and related topics (03C10)

Related Items (3)

On vectorizations of unary generalized quantifiers ⋮ Conditional probability logic, lifted Bayesian networks, and almost sure quantifier elimination ⋮ Almost everywhere elimination of probability quantifiers

Cites Work

• Infinitary logics and 0-1 laws
• Unary quantifiers on finite models
• Generalized quantifiers and pebble games on finite structures
• Almost Everywhere Equivalence of Logics in Finite Model Theory
• Almost sure theories
• An extension of 0‐1 laws
• Random sparse unary predicates
• Infinitary logics and very sparse random graphs
• Hierarchies of monadic generalized quantifiers
• Zero-one laws with variable probability
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

This page was built for publication: On probabilistic elimination of generalized quantifiers