3 citations · 5 across the 4 of their papers we have counts for
4 papers
Logic for exact real arithmetic
Helmut Schwichtenberg, Franziskus Wiesnet
Continuing earlier work of the first author with U. Berger, K. Miyamoto and H. Tsuiki, it is shown how a division algorithm for real numbers given as a stream of signed digits can…
A bound for Dickson's lemma
Josef Berger, Helmut Schwichtenberg
We consider a special case of Dickson's lemma: for any two functions on the natural numbers there are two numbers such that both and weakly increase on them, i.…
Constructive aspects of Riemann's permutation theorem for series
J. Berger, D. Bridges, H. Diener +1
The notions of permutable and weak-permutable convergence of a series of real numbers are introduced. Classically, these two notions are equivalent, and,…
A syntactical analysis of non-size-increasing polynomial time computation
Klaus Aehlig, Helmut Schwichtenberg
A syntactical proof is given that all functions definable in a certain affine linear typed lambda-calculus with iteration in all types are polynomial time computable. The proof pro…