Article ID Journal Published Year Pages File Type
4662092 Annals of Pure and Applied Logic 2010 8 Pages PDF
Abstract

In the context of intuitionistic analysis, we consider the set F consisting of all continuous functions ϕ from [0,1] to R such that ϕ(0)=0 and ϕ(1)=1, and the set I0 consisting of ϕ’s in F where there exists x∈[0,1] such that . It is well-known that there are weak counterexamples to the intermediate value theorem, and with Brouwer’s continuity principle we have I0≠F. However, there exists no satisfying answer to . We try to answer to this question by reducing it to a schema (which we call ) about intuitionistic decidability that asserts “there exists an intuitionistically enumerable set that is not intuitionistically decidable”. We also introduce the notion of strong Specker double sequence, and prove that the existence of such a double sequence is equivalent to the existence of a function ϕ∈Fmon where .

Related Topics
Physical Sciences and Engineering Mathematics Logic