Search: in
Independence (mathematical logic)
Independence (mathematical logic) Encyclopedia
  Tutorials     Encyclopedia     Dictionary     Directory  
Independence_(mathematical_logic) Email this to a friend      Independence_(mathematical_logic)

Independence (mathematical logic)

In mathematical logic, a sentence σ is called 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; however, this usage risks confusion with the distinct notion of the undecidability of a decision problem.

Many interesting statements in set theory are independent of Zermelo-Fraenkel set theory (ZF). It is possible for the statement "σ is independent from T" to be itself independent from T. This reflects the fact that statements about proofs of mathematical statements when represented in mathematics become themselves mathematical statements.

Usage note

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

The following statements in set theory are known to be independent of ZF, granting that ZF is consistent (see also the list of statements undecidable in ZFC):

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.

fr:Décidabilité et indécidabilité it:Decidibilitŕ (logica matematica) ru:????????????? ??????? ?????? sv:Oavgörbar





Source: Wikipedia | The above article is available under the GNU FDL. | Edit this article



Related Links in Independence (mathematical logic)

Search for Independence (mathematical logic) in Tutorials
Search for Independence (mathematical logic) in Encyclopedia
Search for Independence (mathematical logic) in Dictionary
Search for Independence (mathematical logic) in Open Directory
Search for Independence (mathematical logic) in Store
Search for Independence (mathematical logic) in PriceGig


Help build the largest human-edited directory on the web.
Submit a Site - Open Directory Project - Become an Editor

Advertisement

Advertisement



Independence (mathematical logic)
Independence_(mathematical_logic) top Independence_(mathematical_logic)

Home - Add TutorGig to Your Site - Disclaimer

©2008-2009 TutorGig.com. All Rights Reserved. Privacy Statement