Exact bounds on epsilon processes
classification
🧮 math.LO
keywords
epsilonprocessesapproximatingboundscalculableexactlengthsmethod
read the original abstract
In this paper we show that the lengths of the approximating processes in epsilon substitution method are calculable by ordinal recursions in an optimal way.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.