Almost everywhere elimination of probability quantifiers

DOI10.2178/JSL/1254748683MaRDI QIDQ3655247zbMATH OpenOpenAlexFDO

Authors H. Jerome Keisler, Wafik Boulos Lotfallah

Publication date 7 January 2010

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2178/jsl/1254748683

zbMATH Keywords

finite model theoryprobability quantifierszero-one law

Mathematics Subject Classification ID

Quantifier elimination, model completeness, and related topics (03C10) Model theory of finite structures (03C13) Logic with extra quantifiers and operators (03C80)

Recommendations

• On Almost Sure Elimination of Numerical Quantifiers
• On probabilistic elimination of generalized quantifiers
• Almost Everywhere Equivalence of Logics in Finite Model Theory
• Stability, the finite cover property and 0-1 laws
• On the Complexity of the First-order Random Theory

Cites work

• Almost Everywhere Equivalence of Logics in Finite Model Theory
• Cybernetics
• Finite-model theory -- A personal perspective
• Infinitary logics and 0-1 laws
• On Almost Sure Elimination of Numerical Quantifiers
• On probabilistic elimination of generalized quantifiers

Cited in

(16)

• Conditional probability logic, lifted Bayesian networks, and almost sure quantifier elimination
• On probabilistic elimination of generalized quantifiers
• Completeness and interpolation of almost-everywhere quantification over finitely additive measures
• Almost Everywhere Equivalence of Logics in Finite Model Theory
• On the Complexity of the First-order Random Theory
• On Almost Sure Elimination of Numerical Quantifiers
• Stability, the finite cover property and 0-1 laws
• scientific article; zbMATH DE number 7471705 (Why is no real title available?)
• An Asymptotic Analysis of Probabilistic Logic Programming, with Implications for Expressing Projective Families of Distributions
• Convergence laws for expansions of linear preorders
• Random expansions of finite structures with bounded degree
• Probabilistic semantics and calculi for multi-valued and paraconsistent logics
• On the relative asymptotic expressivity of inference frameworks
• 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: Almost everywhere elimination of probability quantifiers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3655247)