{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:08:31Z","timestamp":1761610111389,"version":"build-2065373602"},"reference-count":12,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":4046,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2002,7]]},"DOI":"10.1016\/s1571-0661(04)80382-7","type":"journal-article","created":{"date-parts":[[2004,9,28]],"date-time":"2004-09-28T11:29:37Z","timestamp":1096370977000},"page":"104-112","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"title":["Fixed Points on the Real Numbers without the Equality Test"],"prefix":"10.1016","volume":"66","author":[{"given":"M.V.","family":"Korovina","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1975","series-title":"Admissible sets and structures","author":"Barwise","key":"10.1016\/S1571-0661(04)80382-7_NEWBIB1"},{"key":"10.1016\/S1571-0661(04)80382-7_NEWBIB2","series-title":"Inductive definitions, Generalized Recursion Theory","first-page":"265","author":"Gandy","year":"1974"},{"year":"1996","series-title":"Definability and computability","author":"Ershov","key":"10.1016\/S1571-0661(04)80382-7_NEWBIB3"},{"key":"10.1016\/S1571-0661(04)80382-7_NEWBIB4","first-page":"323","article-title":"Computational complexity of real functions","volume":"v. 20","author":"Freedman","year":"1982","journal-title":"Theoret. Comput. Sci."},{"issue":"N 44","key":"10.1016\/S1571-0661(04)80382-7_NEWBIB5","doi-asserted-by":"crossref","first-page":"61","DOI":"10.4064\/fm-44-1-61-71","article-title":"On the definitions of computable real continuous functions","author":"Grzegorczyk","year":"1957","journal-title":"Fund. Math"},{"key":"10.1016\/S1571-0661(04)80382-7_NEWBIB6","doi-asserted-by":"crossref","unstructured":"A. Blass, Y. Gurevich, Background, Reserve and Gandy Machines, Proceedings of CSL'2000, LNCS N 1862, 2000, pages 1\u201317.","DOI":"10.1007\/3-540-44622-2_1"},{"key":"10.1016\/S1571-0661(04)80382-7_NEWBIB7","unstructured":"P. G. Hinman, Recursion on abstract structures, Handbook of Computability Theory, Elsevier, 1999, pages 317\u2013359."},{"key":"10.1016\/S1571-0661(04)80382-7_NEWBIB8","doi-asserted-by":"crossref","unstructured":"M. Korovina, O. Kudinov, Characteristic Properties of Majorant-Computability over the Reals, Proc. of CSL'98, LNCS, 1584, 1999, pages 188\u2013204.","DOI":"10.1007\/10703163_14"},{"key":"10.1016\/S1571-0661(04)80382-7_NEWBIB9","doi-asserted-by":"crossref","unstructured":"M. Korovina, O. Kudinov, Semantic Characterisations of Second-Order Computability over the real Numbers, Proc. of CSL'01, LNCS 2142, 2001, pages 160\u2013173.","DOI":"10.1007\/3-540-44802-0_12"},{"key":"10.1016\/S1571-0661(04)80382-7_NEWBIB10","first-page":"427","article-title":"Abstract first order computability","volume":"v. 138","author":"Moschovakis","year":"1969","journal-title":"Trans. Amer. Math. Soc."},{"year":"1988","series-title":"Computability in Analysis and Physics","author":"Pour-El","key":"10.1016\/S1571-0661(04)80382-7_NEWBIB11"},{"key":"10.1016\/S1571-0661(04)80382-7_NEWBIB12","series-title":"Handbook of Logic in Computer Science, v. 5","first-page":"397","article-title":"Computable functions and semicomputable sets on many-sorted algebras","author":"Tucker","year":"2000"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104803827?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104803827?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:03:31Z","timestamp":1761609811000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104803827"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,7]]}},"alternative-id":["S1571066104803827"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80382-7","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2002,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Fixed Points on the Real Numbers without the Equality Test","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(04)80382-7","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}