{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:14:52Z","timestamp":1725495292943},"publisher-location":"Berlin, Heidelberg","reference-count":41,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540421979"},{"type":"electronic","value":"9783540453352"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45335-0_10","type":"book-chapter","created":{"date-parts":[[2007,11,14]],"date-time":"2007-11-14T17:49:27Z","timestamp":1195062567000},"page":"146-168","source":"Crossref","is-referenced-by-count":4,"title":["Formalisation of Computability of Operators and Real-Valued Functionals via Domain Theory"],"prefix":"10.1007","author":[{"given":"Margarita V.","family":"Korovina","sequence":"first","affiliation":[]},{"given":"Oleg V.","family":"Kudinov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,5,22]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"S. Abramsky, A. Jung, Domain theory, Handbook of Logic in Computer Science, v. 3, Clarendon Press, 1994.","DOI":"10.1093\/oso\/9780198537625.003.0001"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/S0168-0072(96)00017-6","volume":"83","author":"J. Blanck","year":"1997","unstructured":"J. Blanck, Domain representability of metric space, Annals of Pure and Applied Logic, 83, 1997, pages 225\u2013247.","journal-title":"Domain representability of metric space, Annals of Pure and Applied Logic"},{"key":"10_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-11035-5","volume-title":"Admissible sets and structures","author":"J. Barwise","year":"1975","unstructured":"J. Barwise, Admissible sets and structures, Berlin, Springer-Verlag, 1975."},{"key":"10_CR4","volume-title":"Introduction to Analysis","author":"A. Brown","year":"1989","unstructured":"A. Brown, C. Pearcy, Introduction to Analysis, Springer-Verlag, Berlin, 1989."},{"issue":"1","key":"10_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/S0273-0979-1989-15750-9","volume":"21","author":"L. Blum","year":"1989","unstructured":"L. Blum and M. Shub and S. Smale, On a theory of computation and complexity over the reals: NP-completeness, recursive functions and universal machines, Bull. Amer. Math. Soc., (N.S.), v. 21, no. 1, 1989, pages 1\u201346.","journal-title":"Bull. Amer. Math. Soc., (N.S.)"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0304-3975(95)00050-7","volume":"151","author":"A. Edalat","year":"1995","unstructured":"A. Edalat, Domain Theory and integration, Theoretical Computer Science, 151, 1995, pages 163\u2013193.","journal-title":"Theoretical Computer Science"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0304-3975(98)00097-8","volume":"210","author":"A. Edalat","year":"1998","unstructured":"A. Edalat, P. S\u00fcnderhauf, A domain-theoretic approach to computability on the real line, Theoretical Computer Science, 210, 1998, pages 73\u201398.","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"10_CR8","first-page":"367","volume":"11","author":"Yu. L. Ershov","year":"1996","unstructured":"Yu. L. Ershov, Computable functionals of nite types, Algebra and Logic, 11(4), 1996 pages 367\u2013437.","journal-title":"Algebra and Logic"},{"key":"10_CR9","volume-title":"Definability and computability","author":"Yu. L. Ershov","year":"1996","unstructured":"Yu. L. Ershov, Definability and computability, Plenum, New York, 1996."},{"key":"10_CR10","series-title":"PhD thesis","volume-title":"PCF extended with real numbers: a domain-theoretic approach to hair-order exact real number computation","author":"M. H. Escard\u00f3","year":"1997","unstructured":"M. H. Escard\u00f3, PCF extended with real numbers: a domain-theoretic approach to hair-order exact real number computation, PhD thesis, Imperial College, University of London, London, 1997."},{"issue":"1-2","key":"10_CR11","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0166-8641(97)00226-5","volume":"89","author":"T. Erker","year":"1998","unstructured":"T. Erker, M. H. Escard\u00f3, K. Keimel, The way-below relation of function spaces over semantic domain, Topology and its Applications, 89(1-2), pages 61\u201374, 1998.","journal-title":"Topology and its Applications"},{"key":"10_CR12","unstructured":"M. H. Escard\u00f3, Function-space compactifications of function spaces, To appear in Topology and its Applications, 2000."},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/S0304-3975(82)80003-0","volume":"20","author":"H. Freedman","year":"1982","unstructured":"H. Freedman and K. Ko, Computational complexity of real functions, Theoret. Comput. Sci., v. 20, 1982, pages 323\u2013352.","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-67678-9","volume-title":"A Compendium Of Continuous Lattices","author":"G. Gierz","year":"1980","unstructured":"G. Gierz, K.H. Hofmann, K. Keimel, J.D. Lawson, M.W. Mislove, D.S. Scott, A Compendium Of Continuous Lattices, Springer Verlag, Berlin, 1980."},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"A. Grzegorczyk, On the denitions of computable real continuous functions, Fund. Math., N 44, 1957, pages 61\u201371.","DOI":"10.4064\/fm-44-1-61-71"},{"key":"10_CR16","series-title":"Lect Notes Comput Sci","first-page":"36","volume-title":"Towards refining Temporal Specifications into Hybrid Systems","author":"T.A. Henzinger","year":"1993","unstructured":"T.A. Henzinger, Z. Manna, A. Pnueli, Towards refining Temporal Specifications into Hybrid Systems, LNCS N 736, 1993, pages 36\u201360."},{"key":"10_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1007\/3-540-64358-3_40","volume-title":"Reachability Verification for Hybrid Automata","author":"T.A. Henzinger","year":"1998","unstructured":"T.A. Henzinger, V. Rusu, Reachability Verification for Hybrid Automata, LNCS N 1386, 1998, pages 190\u2013205."},{"key":"10_CR18","volume-title":"CWI Tract","author":"A. Jung","year":"1989","unstructured":"A. Jung, Cartesian Closed Categories of Domains, CWI Tract. Centrum voor Wiskunde en Informatica, Amsterdam v. 66, 1989."},{"issue":"4","key":"10_CR19","first-page":"1","volume":"2","author":"M. Korovina","year":"1992","unstructured":"M. Korovina, Generalized computability of real functions, Siberian Advance of Mathematics, v. 2, N 4, 1992, pages 1\u201318.","journal-title":"Siberian Advance of Mathematics"},{"issue":"3","key":"10_CR20","first-page":"59","volume":"8","author":"M. Korovina","year":"1998","unstructured":"M. Korovina, O. Kudinov, A New Approach to Computability over the Reals, SibAM, v. 8, N 3, 1998, pages 59\u201373.","journal-title":"SibAM"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"M. Korovina, O. Kudinov, Characteristic Properties of Majorant-Computability over the Reals, Proc. of CSL\u201998, LNCS, 1584, 1999, pages 188\u2013204.","DOI":"10.1007\/10703163_14"},{"key":"10_CR22","unstructured":"M. Korovina, O. Kudinov, Computability via Approximations, Bulletin of Symbolic Logic, v. 5, N 1, 1999"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"M. Korovina, O. Kudinov, A Logical approach to Specifications of Hybrid Systems, Proc. of PSI\u201999, to appear in LNCS, 2000, pages 10\u201316.","DOI":"10.1007\/3-540-46562-6_2"},{"key":"10_CR24","unstructured":"M. Korovina, O. Kudinov, Computability over the reals without equality, Proceedings of Mal\u2019sev conference on Mathematical Logic, Novosibirsk, p 47, 1999."},{"key":"10_CR25","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1007\/3-540-57318-6_22","volume-title":"Verifying Hybrid Systems","author":"Z. Manna","year":"1993","unstructured":"Z. Manna, A. Pnueli, Verifying Hybrid Systems, LNCS N 736, 1993, pages 4\u201336."},{"key":"10_CR26","doi-asserted-by":"crossref","unstructured":"R. Montague, Recursion theory as a branch of model theory, Proc. of the third international congr. on Logic, Methodology and the Philos. of Sc., 1967, Amsterdam, 1968, pages 63\u201386.","DOI":"10.1016\/S0049-237X(08)71187-X"},{"key":"10_CR27","doi-asserted-by":"publisher","first-page":"427","DOI":"10.2307\/1994926","volume":"138","author":"Y. N. Moschovakis","year":"1969","unstructured":"Y. N. Moschovakis, Abstract first order computability, Trans. Amer. Math. Soc., v. 138, 1969, pages 427\u2013464.","journal-title":"Trans. Amer. Math. Soc."},{"key":"10_CR28","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/3-540-57318-6_35","volume-title":"Models for Hybrid Systems, Automata, Topologies, Controllability, Observability","author":"A. Nerode","year":"1993","unstructured":"A. Nerode, W. Kohn, Models for Hybrid Systems, Automata, Topologies, Controllability, Observability, LNCS N 736, 1993, pages 317\u2013357."},{"key":"10_CR29","doi-asserted-by":"crossref","unstructured":"Pietro Di Gianantonio, Real number computation and domain theory, Information and Computation, N 127, 1996, pages 11\u201325.","DOI":"10.1006\/inco.1996.0046"},{"key":"10_CR30","doi-asserted-by":"crossref","unstructured":"M. B. Pour-El, J. I. Richards, Computability in Analysis and Physics, Springer-Verlag, 1988.","DOI":"10.1007\/978-3-662-21717-7"},{"key":"10_CR31","unstructured":"D. Scott, Outline of a mathematical theory of computation, In 4th Annual Princeton Conference on Information Sciences and Systems, 1970, pages 169\u2013176."},{"key":"10_CR32","doi-asserted-by":"crossref","unstructured":"D. Scott, Continuous lattices, Lecture Notes in Mathematics, 274, Toposes, Algebraic geometry and Logic, Springer-Verlag, 1972, pages 97\u2013136.","DOI":"10.1007\/BFb0073967"},{"key":"10_CR33","doi-asserted-by":"crossref","unstructured":"E. Schechter, Handbook of Analysis and Its Foundations, Academic Pressbook, 1996.","DOI":"10.1016\/B978-012622760-4\/50002-9"},{"key":"10_CR34","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1017\/S0022481200028498","volume":"53","author":"V. Stoltenberg-Hansen","year":"1988","unstructured":"V. Stoltenberg-Hansen and J. V. Tucker, Complete local rings as domains, Journal of Symbolic Logic, 53, 1988, pages 603\u2013624.","journal-title":"Journal of Symbolic Logic"},{"key":"10_CR35","first-page":"375","volume":"4","author":"V. Stoltenberg-Hansen","year":"1995","unstructured":"V. Stoltenberg-Hansen and J. V. Tucker, Effective algebras, Handbook of Logic in computer Science, v. 4, Clarendon Press, 1995, pages 375\u2013526.","journal-title":"Handbook of Logic in computer Science"},{"key":"10_CR36","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1215\/S0012-7094-52-01928-5","volume":"19","author":"H. Tong","year":"1952","unstructured":"H. Tong, Some characterizations of normal and perfectly normal space, Duke Math. J. N 19, 1952, pages 289\u2013292.","journal-title":"Duke Math. J. N"},{"key":"10_CR37","unstructured":"B.A. Trakhtenbrot, Yu. Barzdin, Finite automata: Behaviour and Syntheses, North-Holland, 1973."},{"key":"10_CR38","unstructured":"K. Weihrauch, Computability, volume 9 of EATCS Monographs on Theoretical Computer Science, Springer, Berlin, 1987."},{"key":"10_CR39","volume-title":"Informatik Berichte","author":"K. Weihrauch","year":"1995","unstructured":"K. Weihrauch, A simple introduction to computable analysis, Informatik Berichte 171, FernUniversitat, Hagen, 1995, 2-nd edition.","edition":"2-nd edition"},{"key":"10_CR40","series-title":"Lect Notes Comput Sci","first-page":"165","volume-title":"Complexity Theory on Real Numbers and Functions","author":"C. Kreitz","year":"1983","unstructured":"C. Kreitz, K. Weihrauch, Complexity Theory on Real Numbers and Functions, LNCS, 145, 1983, pages 165\u2013175."},{"key":"10_CR41","series-title":"Lect Notes Comput Sci","first-page":"166","volume-title":"Lower Semi-Continuous and Upper Semi-Continuous real Functions","author":"K. Weihrauch","year":"1997","unstructured":"K. Weihrauch, X. Zheng Computability on Continuous, Lower Semi-Continuous and Upper Semi-Continuous real Functions, LNCS, 1276, 1997, pages 166\u2013186."}],"container-title":["Lecture Notes in Computer Science","Computability and Complexity in Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45335-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,19]],"date-time":"2024-02-19T02:11:42Z","timestamp":1708308702000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45335-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540421979","9783540453352"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/3-540-45335-0_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}