nLab weak limited principle of omniscience

Redirected from "WLPO".

Context

Foundations

foundations

The basis of it all

 Set theory

set theory

Foundational axioms

foundational axioms

Removing axioms

Contents

Definition

The weak limited principle of omniscience (WLPOWLPO) states that the universal quantification of any decidable proposition on the natural numbers is again decidable. That is,

(x,P(x)¬P(x))(x,P(x))¬(x,P(x)).(\forall x \in \mathbb{N}, P(x) \vee \neg{P(x)}) \Rightarrow (\forall x \in \mathbb{N}, P(x)) \vee \neg(\forall x \in \mathbb{N}, P(x)).

Equivalently, that the negation of the existential quantifier of any decidable proposition is decidable:

(x,P(x)¬P(x))(¬x,P(x))¬(¬x,P(x)).(\forall x \in \mathbb{N}, P(x) \vee \neg{P(x)}) \Rightarrow (\neg \exists x \in \mathbb{N}, P(x)) \vee \neg(\neg \exists x \in \mathbb{N}, P(x)).

We can also state the principle set-theoretically. The weak limited principle of omniscience (WLPOWLPO) states that given a subset P𝒫()P \in \mathcal{P}(\mathbb{N}), if PP is a decidable subset of \mathbb{N} (PP¯=P \cup \bar{P} = \mathbb{N}), then either P¯=\bar{P} = \mathbb{N} or ¬(P=)\neg (P = \emptyset), where P¯\bar{P} is the complement of PP.

Equivalent statements

There are various other results that are equivalent to the weak limited principle of omniscience. Here are a few:

  • WLPOWLPO follows from LPO, but not conversely. If P(x)P(x) is a decidable proposition, then so is ¬P(x)\neg{P(x)}, and so LPOLPO gives

    (x,¬P(x))(x,¬¬P(x)),(\exists x \in \mathbb{N}, \neg{P(x)}) \vee (\forall x \in \mathbb{N}, \neg{\neg{P(x)}}),

    which implies

    ¬(x,P(x))(x,P(x))\neg(\forall x \in \mathbb{N}, P(x)) \vee (\forall x \in \mathbb{N}, P(x))

    as PP is decidable.

  • The LLPO follows from WLPO, since WLPO is equivalent to untruncated LLPO, which implies truncated LLPO. However, the converse does not necessarily hold, since in http://www1.maths.leeds.ac.uk/~rathjen/Lifschitz.pdf is a model by Michael Rathjen that separates WLPO from LLPO. Similarly, Grossack 24 shows that Johnstone’s topological topos separates WLPO from LLPO.

  • The WLPO implies the stable fan theorem.

Generalizations

Choiceless weak limited principle of omniscience

There is a generalization of the weak limited principle of omniscience defined in King 2024, which was suggested to be called the choiceless weak limited principle of omniscience. The choiceless weak limited principle of omniscience states that given a pair of predicates PP and QQ on the natural numbers \mathbb{N} such that P(x)Q(x)P(x) \vee Q(x) holds for all xx \in \mathbb{N}, then either for all xx \in \mathbb{N}, Q(x)Q(x), or it is not true that for all xx \in \mathbb{N}, ¬P(x)\neg P(x).

(x.P(x)Q(x))((x.Q(x))¬(x.¬P(x)))(\forall x \in \mathbb{N}.P(x) \vee Q(x)) \Rightarrow ((\forall x \in \mathbb{N}.Q(x)) \vee \neg (\forall x \in \mathbb{N}.\neg P(x)))

The idea behind the term “choiceless” is that one isn’t forced to choose between P(x)P(x) or Q(x)Q(x) in this version of the weak limited principle of omniscience. One gets back the usual weak limited principle of omniscience if P(x)P(x) and Q(x)Q(x) are mutually exclusive propositions for all xx \in \mathbb{N}, from which Q(x)Q(x) if and only if ¬P(x)\neg P(x) for all xx \in \mathbb{N}.

We can also state the principle set-theoretically. The choiceless weak limited principle of omniscience states that given subsets P,Q𝒫()P, Q \in \mathcal{P}(\mathbb{N}), if PQ=P \cup Q = \mathbb{N}, then either Q=Q = \mathbb{N} or ¬(P=)\neg (P = \emptyset). One gets back the usual limited principle of omniscience if PP and QQ are disjoint subsets PQ=P \cap Q = \emptyset, from which Q=P¯Q = \bar{P}, where P¯\bar{P} is the complement of PP.

The choiceless weak limited principle of omniscience for the natural numbers \mathbb{N} implies the analytic weak limited principle of omniscience for all sets of real numbers, as shown in King 2024.

 References

Last revised on June 19, 2026 at 14:33:42. See the history of this page for a list of all contributions to it.