Axiom Of Choice

We have the following indirect implication of form equivalence classes:

1 \(\Rightarrow\) 326 given by the following sequence of implications, with a reference to its direct proof:

Implication	Reference
1 \(\Rightarrow\) 326

Here are the links and statements of the form equivalence classes referenced above:

Howard-Rubin Number	Statement
1:	\(C(\infty,\infty)\): The Axiom of Choice: Every set of non-empty sets has a choice function.
326:	2-SAT: Restricted Compactness Theorem for Propositional Logic III: If \(\Sigma\) is a set of formulas in a propositional language such that every finite subset of \(\Sigma\) is satisfiable and if every formula in \(\Sigma\) is a disjunction of at most two literals, then \(\Sigma\) is satisfiable. (A literal is a propositional variable or its negation.) Wojtylak [1999] (listed as Wojtylak [1995])

Comment:

Back