Lably
Skip to content

Independence (mathematical logic)

Term in mathematical logic

  • 2 min read
  • 4 chapters

Related on Lably

Through Mathematical logic, Sentence (mathematical logic) and Interpretation (logic)

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 concept is unrelated to the idea of "decidability" as in a decision problem.)

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

Usage note

Some authors say that σ is independent of T when 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 σ.

Sign in to keep reading

3 more chapters are free with a Lably account.

More in Foundations