Loading AI tools
From Wikipedia, the free encyclopedia
Bar induction is a reasoning principle used in intuitionistic mathematics, introduced by L. E. J. Brouwer. Bar induction's main use is the intuitionistic derivation of the fan theorem, a key result used in the derivation of the uniform continuity theorem.
It is also useful in giving constructive alternatives to other classical results.
The goal of the principle is to prove properties for all infinite sequences of natural numbers (called choice sequences in intuitionistic terminology), by inductively reducing them to properties of finite lists. Bar induction can also be used to prove properties about all choice sequences in a spread (a special kind of set).
Given a choice sequence , any finite sequence of elements of this sequence is called an initial segment of this choice sequence.
There are three forms of bar induction currently in the literature, each one places certain restrictions on a pair of predicates and the key differences are highlighted using bold font.
Given two predicates and on finite sequences of natural numbers such that all of the following conditions hold:
then we can conclude that holds for the empty sequence (i.e. A holds for all choice sequences starting with the empty sequence).
This principle of bar induction is favoured in the works of, A. S. Troelstra, S. C. Kleene and Albert Dragalin.
Given two predicates and on finite sequences of natural numbers such that all of the following conditions hold:
then we can conclude that holds for the empty sequence.
This principle of bar induction is favoured in the works of Joan Moschovakis and is (intuitionistically) provably equivalent to decidable bar induction.
Given two predicates and on finite sequences of natural numbers such that all of the following conditions hold:
then we can conclude that holds for the empty sequence.
This principle of bar induction is used in the works of A. S. Troelstra, S. C. Kleene, Dragalin and Joan Moschovakis.
The following results about these schemata can be intuitionistically proved:
(The symbol "" is a "turnstile".)
An additional schema of bar induction was originally given as a theorem by Brouwer (1975) containing no "extra" restriction on under the name The Bar Theorem. However, the proof for this theorem was erroneous, and unrestricted bar induction is not considered to be intuitionistically valid (see Dummett 1977 pp 94–104 for a summary of why this is so). The schema of unrestricted bar induction is given below for completeness.
Given two predicates and on finite sequences of natural numbers such that all of the following conditions hold:
then we can conclude that holds for the empty sequence.
In classical reverse mathematics, "bar induction" () denotes the related principle stating that if a relation is a well-order, then we have the schema of transfinite induction over for arbitrary formulas.
Seamless Wikipedia browsing. On steroids.
Every time you click a link to Wikipedia, Wiktionary or Wikiquote in your browser's search results, it will show the modern Wikiwand interface.
Wikiwand extension is a five stars, simple, with minimum permission required to keep your browsing private, safe and transparent.