Independence (mathematical logic)

From Wikipedia, the free encyclopedia
  (Redirected from Independent (mathematical logic))
Jump to: navigation, search

In mathematical logic, independence refers to the unprovability of a sentence from other sentences.

A sentence σ is independent of a given first-order theory T if T neither proves nor refutes σ; that is, it is impossible to prove σ from T, and it is also impossible to prove from T that σ is false. Sometimes, σ is said (synonymously) to be undecidable from T; this is not the same meaning of "decidability" as in a decision problem.

A theory T is independent if each axiom in T is not provable from the remaining axioms in T. A theory for which there is an independent set of axioms is independently axiomatizable.

Usage note[edit]

Some authors say that σ is independent of T if T simply cannot prove σ, and do not necessarily assert by this that T cannot refute σ. These authors will sometimes say "σ is independent of and consistent with T" to indicate that T can neither prove nor refute σ.

Independence results in set theory[edit]

Many interesting statements in set theory are independent of Zermelo-Fraenkel set theory (ZF). The following statements in set theory are known to be independent of ZF, granting that ZF is consistent:

The following statements (none of which have been proved false) cannot be proved in ZFC to be independent of ZFC, even if the added hypothesis is granted that ZFC is consistent. However, they cannot be proved in ZFC (granting that ZFC is consistent), and few working set theorists expect to find a refutation of them in ZFC.

The following statements are inconsistent with the axiom of choice, and therefore with ZFC. However they are probably independent of ZF, in a corresponding sense to the above: They cannot be proved in ZF, and few working set theorists expect to find a refutation in ZF. However ZF cannot prove that they are independent of ZF, even with the added hypothesis that ZF is consistent.

See also[edit]