Decidability in elementary analysis. II (Q912081)

[For Part I see ibid. 76, No.1, 94-115 (1989; Zbl 0681.03005).] The authors continue their study of sentences of the form (\(\forall f\in {\mathcal F})\phi\) where \({\mathcal F}\) is a family of functions from R to R or from \(I=[0,1]\) to I and \(\phi\) is a first order formula that (possibly) involves the ordering of R, quantification over R, and the unary function symbol f. By giving a reduction to the halting problem the authors prove that if \({\mathcal F}\) is the set of monotone continuous functions from R to R with finitely many constant intervals, then \(\{\phi| (\forall f\in {\mathcal F})\phi\) true\(\}\) is undecidable. However for \({\mathcal M}\) the family of monotone functions \(\{\) \(\phi\) \(|\) \(\phi\) separated and (\(\forall f\in {\mathcal F})\phi\) true\(\}\) is decidable. Let \({\mathcal F}_ n\) be the set of monotone functions from I to I with \(f(0)=0\) and \(f(1)=1\) and at most n intervals of constancy and at most n points of discontinuity. Then \(\{\phi|\) (\(\forall f\in {\mathcal F}_ n)\phi\) true\(\}\) is decidable. The paper ends with some undecidability results about separated sentences.