Decidability and Specker sequences in intuitionistic mathematics

@article{Ardeshir2009DecidabilityAS,
  title={Decidability and Specker sequences in intuitionistic mathematics},
  author={M. Ardeshir and Rasoul Ramezanian},
  journal={Math. Log. Q.},
  year={2009},
  volume={55},
  pages={637-648}
}
A bounded monotone sequence of reals without a limit is called a Specker sequence. In Russian constructive analysis, Church's Thesis permits the existence of a Specker sequence. In intuitionistic mathematics, Brouwer's Continuity Principle implies it is false that every bounded monotone sequence of real numbers has a limit. We claim that the existence of Specker sequences crucially depends on the properties of intuitionistic decidable sets. We propose a schema (which we call ED) about… Expand
7 Citations
The double negation of the intermediate value theorem
A Hypercomputation in Brouwer's Constructivism
On the constructive notion of closure maps
Compactness, colocatedness, measurability and ED
The principle of open induction and Specker sequences

References

SHOWING 1-8 OF 8 REFERENCES
Specker sequences revisited
  • J. Simonsen
  • Mathematics, Computer Science
  • Math. Log. Q.
  • 2005
Theory Of Formal Languages With Applications
Nicht Konstruktiv Beweisbare Satze Der Analysis
  • E. Specker
  • Mathematics, Computer Science
  • J. Symb. Log.
  • 1949
An interpretation of intuitionistic analysis
Constructivism in Mathematics, Vol. 1 (North-Holland, 1988)
  • WILEY-VCH Verlag GmbH & Co. KGaA,
  • 2009
Nicht konstruktiv beweisbare Sätze der
  • Analysis. J. Symbolic Logic
  • 1949