Implications

We have the following indirect implication of form equivalence classes:

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

Implication Reference
326 \(\Rightarrow\) 88 Logic at Work: Essay Dedicated to the Memory of Helen Rasiowa, Wojtylak, 1999,
88 \(\Rightarrow\) 80 clear
80 \(\Rightarrow\) 389 clear

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

Howard-Rubin Number Statement
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])

88:

  \(C(\infty ,2)\):  Every family of pairs has a choice function.

80:

\(C(\aleph_{0},2)\):  Every denumerable set of  pairs has  a  choice function.

389:

\(C(\aleph_0,2,\cal P({\Bbb R}))\): Every denumerable family of two element subsets of \(\cal P({\Bbb R})\) has a choice function.  \ac{Keremedis} \cite{1999b}.

Comment:

Back