{"docId":3772,"paperId":3772,"url":"https:\/\/lmcs.episciences.org\/3772","doi":"10.23638\/LMCS-13(3:3)2017","journalName":"Logical Methods in Computer Science","issn":"","eissn":"1860-5974","volume":[{"vid":308,"name":"Volume 13, Issue 3"}],"section":[],"repositoryName":"arXiv","repositoryIdentifier":"1703.01470","repositoryVersion":2,"repositoryLink":"https:\/\/arxiv.org\/abs\/1703.01470v2","dateSubmitted":"2017-07-06 11:16:31","dateAccepted":"2017-07-06 11:24:50","datePublished":"2017-07-06 11:25:00","titles":["Characterization theorem for the conditionally computable real functions"],"authors":["Georgiev, Ivan"],"abstracts":["The class of uniformly computable real functions with respect to a small subrecursive class of operators computes the elementary functions of calculus, restricted to compact subsets of their domains. The class of conditionally computable real functions with respect to the same class of operators is a proper extension of the class of uniformly computable real functions and it computes the elementary functions of calculus on their whole domains. The definition of both classes relies on certain transformations of infinitistic names of real numbers. In the present paper, the conditional computability of real functions is characterized in the spirit of Tent and Ziegler, avoiding the use of infinitistic names."],"keywords":["Mathematics - Logic","F.1.1","F.1.3"]}