{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,29]],"date-time":"2023-10-29T04:38:48Z","timestamp":1698554328505},"reference-count":27,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,11,13]],"date-time":"2006-11-13T00:00:00Z","timestamp":1163376000000},"content-version":"vor","delay-in-days":3603,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Logic Qtrly"],"published-print":{"date-parts":[[1997,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We investigate operations, computable in the sense of Recursive Analysis, which can be generated recursively from the arithmetic operations and the limit operation without using any tests on the real numbers. These functions, called order\u2010free recursive, can be shown to include a large class of computable functions. As main tools we provide an effective version of the Stone\u2010Weierstra\u00df Approximation Theorem, as well as recursive partitions of unity.<\/jats:p>","DOI":"10.1002\/malq.19970430206","type":"journal-article","created":{"date-parts":[[2007,5,30]],"date-time":"2007-05-30T06:46:18Z","timestamp":1180507578000},"page":"216-234","source":"Crossref","is-referenced-by-count":9,"title":["Order\u2010free Recursion on the Real Numbers"],"prefix":"10.1002","volume":"43","author":[{"given":"Vasco","family":"Brattka","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,11,13]]},"reference":[{"key":"e_1_2_1_2_2","series-title":"Fern Universit\u00e4t Hagen 190 (1995)","first-page":"1","volume-title":"Proc. of the Workshop on Computability and Complexity in Analysis","author":"Blanck J."},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1090\/S0273-0979-1989-15750-9"},{"key":"e_1_2_1_4_2","volume-title":"General Topology, Part 1 and 2","author":"Bourbaki N.","year":"1966"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00249-9"},{"key":"e_1_2_1_6_2","series-title":"Fern Universit\u00e4t Hagen 190","first-page":"125","volume-title":"Proc. of the Workshop on Computability and Complexity in Analysis","author":"Brattka V.","year":"1995"},{"key":"e_1_2_1_7_2","series-title":"FernUniversitat Hagen 193","volume-title":"Feasible real random access machines","author":"Brattka V.","year":"1995"},{"key":"e_1_2_1_8_2","first-page":"5","volume-title":"Proc. of the Workshop on Computability and Complexity in Analysis","author":"Brattka V.","year":"1996"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-58140-5_12"},{"key":"e_1_2_1_10_2","doi-asserted-by":"crossref","first-page":"61","DOI":"10.4064\/fm-44-1-61-71","article-title":"On the definition of computable real continuous functions","volume":"44","author":"Grzegorczyk A.","year":"1957","journal-title":"Fund. Math."},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19730190804"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19760220136"},{"key":"e_1_2_1_13_2","volume-title":"Topologie II","author":"Herrlich H.","year":"1988"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(82)80003-0"},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-6802-1"},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0099489"},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(87)90010-8"},{"key":"e_1_2_1_18_2","first-page":"2478","article-title":"Extension de la notion de fonction r\u00e9cursive aux fonctions d'une ou plusieurs variables r\u00e9elles I\u2010III","volume":"240","author":"Lacombe D.","year":"1955","journal-title":"Comptes Rendus"},{"key":"e_1_2_1_19_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00248-0"},{"key":"e_1_2_1_20_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-21717-7"},{"key":"e_1_2_1_21_2","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19750210102"},{"key":"e_1_2_1_22_2","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19760220148"},{"key":"e_1_2_1_23_2","volume-title":"Information\u2010Based Complexity","author":"Traub J.","year":"1988"},{"key":"e_1_2_1_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(93)90001-A"},{"key":"e_1_2_1_25_2","unstructured":"Weihrauch K. Grundlagen der Effektiven Analysis. Correspondence Course 1681 Fern Universit\u00e4t Hagen1994."},{"key":"e_1_2_1_26_2","unstructured":"Weihrauch K. A Simple Introduction to Computable Analysis. Informatik Berichte 171 Fern Universit\u00e4t Hagen1995."},{"key":"e_1_2_1_27_2","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(87)90065-0"},{"key":"e_1_2_1_28_2","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19960420132"}],"container-title":["Mathematical Logic Quarterly"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fmalq.19970430206","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/malq.19970430206","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,28]],"date-time":"2023-10-28T09:11:53Z","timestamp":1698484313000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/malq.19970430206"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,1]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,1]]}},"alternative-id":["10.1002\/malq.19970430206"],"URL":"https:\/\/doi.org\/10.1002\/malq.19970430206","archive":["Portico"],"relation":{},"ISSN":["0942-5616","1521-3870"],"issn-type":[{"value":"0942-5616","type":"print"},{"value":"1521-3870","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,1]]}}}