On probabilistic elimination of generalized quantifiers
From MaRDI portal
Recommendations
Cites work
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- Almost Everywhere Equivalence of Logics in Finite Model Theory
- Almost sure theories
- An extension of 0‐1 laws
- Generalized quantifiers and pebble games on finite structures
- Hierarchies of monadic generalized quantifiers
- Infinitary logics and 0-1 laws
- Infinitary logics and very sparse random graphs
- Random sparse unary predicates
- Unary quantifiers on finite models
- Zero-one laws with variable probability
Cited in
(13)- Bucket elimination: A unifying framework for reasoning
- Conditional probability logic, lifted Bayesian networks, and almost sure quantifier elimination
- Quantifier Elimination for Quantified Propositional Logics on Kripke Frames of Type
- scientific article; zbMATH DE number 5526522 (Why is no real title available?)
- Almost everywhere elimination of probability quantifiers
- On vectorizations of unary generalized quantifiers
- On Almost Sure Elimination of Numerical Quantifiers
- Convergence Laws for Very Sparse Random Structures with Generalized Quantifiers
- The generality of the zero-one laws
- Random expansions of finite structures with bounded degree
- A general approach to asymptotic elimination of aggregation functions and generalized quantifiers
- First-order logic with equicardinality in random graphs
- A convergence law for continuous logic and continuous structures with finite domains
This page was built for publication: On probabilistic elimination of generalized quantifiers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2748424)