Almost Everywhere Elimination of Probability Quantifiers H. Jerome Keisler and Wafik Boulos Lotfallah
نویسنده
چکیده
We obtain an almost everywhere quantifier elimination for (the noncritical fragment of) the logic with probability quantifiers, introduced by the first author in [9]. This logic has quantifiers like ∃≥3/4y, which says that “for at least 3/4 of all y”. These results improve upon the 0-1 law for a fragment of this logic obtained by Knyazev [11]. Our improvements are: 1. We deal with the quantifier ∃≥ry, where y is a tuple of variables. 2. We remove the closedness restriction, which requires that the variables in y occur in all atomic subformulas of the quantifier scope. 3. Instead of the uniform measure, we work with any measure generated by independent atomic probabilities pR for each predicate symbol R. 4. We extend the results to a natural (noncritical) fragment of the infinitary logic with probability quantifiers. 5. We allow each pR, as well as each r in the probability quantifier (∃≥ry), to depend on the size of the universe. §
منابع مشابه
Almost everywhere elimination of probability quantifiers
We obtain an almost everywhere quantifier elimination for (the noncritical fragment of) the logic with probability quantifiers, introduced by the first author in [10]. This logic has quantifiers like ∃≥3/4y, which says that “for at least 3/4 of all y”. These results improve upon the 0-1 law for a fragment of this logic obtained by Knyazev [11]. Our improvements are: 1. We deal with the quantifi...
متن کاملA local normal form theorem for infinitary logic with unary quantifiers
We prove a local normal form theorem of the Gaifman type for the infinitary logic L∞ω(Qu) whose formulas involve arbitrary unary quantifiers but finite quantifier rank. We use a local EhrenfeuchtFräıssé type game similar to the one in [KL04]. A consequence is that every sentence of L∞ω(Qu) of quantifier rank n is equivalent to an infinite Boolean combination of sentences of the form (∃≥iy)ψ(y) ...
متن کاملRank Hierarchies for Generalized Quantifiers
We show that for each n and m, there is an existential first order sentence which is NOT logically equivalent to a sentence of quantifier rank at most m in infinitary logic augmented with all generalized quantifiers of arity at most n. We use this to show the strictness of the quantifier rank hierarchies for various logics ranging from existential (or universal) fragments of first order logic t...
متن کاملShrinking games and local formulas
Gaifman’s normal form theorem showed that every first order sentence of quantifier rank n is equivalent to a Boolean combination of “scattered local sentences”, where the local neighborhoods have radius at most 7n−1. This bound was improved by Lifsches and Shelah to 3 · 4n−1. We use Ehrenfeucht-Fräıssé type games with a “shrinking horizon” to get a spectrum of normal form theorems of the Gaifma...
متن کاملCompleteness and interpolation of almost-everywhere quantification over finitely additive measures
We give an axiomatization of first-order logic enriched with the almosteverywhere quantifier over finitely additive measures. Using an adapted version of the consistency property adequate for dealing with this generalized quantifier, we show that such a logic is both strongly complete and enjoys Craig interpolation, relying on a (countable) model existence theorem. We also discuss possible exte...
متن کامل