{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:24:40Z","timestamp":1742970280892,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642030727"},{"type":"electronic","value":"9783642030734"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03073-4_10","type":"book-chapter","created":{"date-parts":[[2009,7,14]],"date-time":"2009-07-14T08:06:17Z","timestamp":1247558777000},"page":"89-98","source":"Crossref","is-referenced-by-count":3,"title":["Program Self-reference in Constructive Scott Subdomains"],"prefix":"10.1007","author":[{"given":"John","family":"Case","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"suffix":"III","given":"Samuel E.","family":"Moelius","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-1-4615-0755-0_2","volume-title":"Computability and models","author":"S. Badaev","year":"2003","unstructured":"Badaev, S., Goncharov, S., Sorbi, A.: Completeness and universality of arithmetical numberings. In: Computability and models, pp. 11\u201344. Springer, Heidelberg (2003)"},{"issue":"3","key":"10_CR2","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1145\/321650.321651","volume":"18","author":"J. Case","year":"1971","unstructured":"Case, J.: A note on the degrees of self-describing Turing machines. Journal of the ACM\u00a018(3), 329\u2013338 (1971)","journal-title":"Journal of the ACM"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Case, J., Moelius, S.: Independence results for n-ary recursion theorems (2009) (submitted)","DOI":"10.1007\/978-3-642-03409-1_5"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Case, J., Moelius, S.: Program self-reference in constructive Scott subdomains (expanded version) (2009), http:\/\/www.cis.udel.edu\/~moelius\/publications","DOI":"10.1007\/978-3-642-03073-4_10"},{"key":"10_CR5","unstructured":"Ershov, Y.L.: Theory of Numberings, Nauka, Moscow (1977) (in Russian)"},{"key":"10_CR6","volume-title":"G\u00f6del, Escher, Bach: An Eternal Golden Braid","author":"D.R. Hofstadter","year":"1979","unstructured":"Hofstadter, D.R.: G\u00f6del, Escher, Bach: An Eternal Golden Braid. Basic Books, Inc., New York (1979)"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1007\/978-3-642-03073-4_28","volume-title":"CiE 2009","author":"S. Jain","year":"2009","unstructured":"Jain, S., Stephan, F., Teutsch, J.: Index sets and universal numberings, 2009. In: Ambos-Spies, K., L\u00f6we, B., Merkle, W. (eds.) CiE 2009. LNCS, vol.\u00a05635, pp. 270\u2013279. Springer, Heidelberg (2009)"},{"key":"10_CR8","unstructured":"Lee, C.Y.: A Turing machine which prints its own code script. In: Proc. of the Symposium on Mathematical Theory of Automata, pp. 155\u2013164 (1963)"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Moore, K.: MIME (Multipurpose Internet Mail Extensions) Part Three: Message Header Extensions for Non-ASCII Text (1996), RFC2047","DOI":"10.17487\/rfc2047"},{"issue":"1","key":"10_CR10","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1137\/0207003","volume":"7","author":"M. Machtey","year":"1978","unstructured":"Machtey, M., Winklmann, K., Young, P.: Simple G\u00f6del numberings, isomorphisms, and programming properties. SIAM Journal on Computing\u00a07(1), 39\u201360 (1978)","journal-title":"SIAM Journal on Computing"},{"key":"10_CR11","volume-title":"An Introduction to the General Theory of Algorithms","author":"M. Machtey","year":"1978","unstructured":"Machtey, M., Young, P.: An Introduction to the General Theory of Algorithms. North-Holland, Amsterdam (1978)"},{"key":"#cr-split#-10_CR12.1","unstructured":"Quine, W.V.: The Ways of Paradox and other essays. Random House (1966)"},{"key":"#cr-split#-10_CR12.2","unstructured":"reprinted Harvard University Press (1976)"},{"key":"10_CR13","unstructured":"Riccardi, G.: The Independence of Control Structures in Abstract Programming Systems. PhD thesis, SUNY Buffalo (1980)"},{"issue":"3","key":"10_CR14","doi-asserted-by":"publisher","first-page":"331","DOI":"10.2307\/2964292","volume":"23","author":"H. Rogers","year":"1958","unstructured":"Rogers, H.: G\u00f6del numberings of partial recursive functions. Journal of Symbolic Logic\u00a023(3), 331\u2013341 (1958)","journal-title":"Journal of Symbolic Logic"},{"key":"10_CR15","unstructured":"Rogers, H.: Theory of Recursive Functions and Effective Computability. McGraw Hill, New York (1967); reprinted MIT Press (1987)"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-18253-5","volume-title":"A Connotational Theory of Program Structure","author":"J. Royer","year":"1987","unstructured":"Royer, J.: A Connotational Theory of Program Structure. LNCS, vol.\u00a0273. Springer, Heidelberg (1987)"},{"key":"10_CR17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139166386","volume-title":"Mathematical Theory of Domains","author":"V. Stoltenberg-Hansen","year":"1994","unstructured":"Stoltenberg-Hansen, V., Lindstr\u00f6m, I., Griffor, E.R.: Mathematical Theory of Domains. Cambridge University Press, Cambridge (1994)"},{"issue":"1","key":"10_CR18","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/0890-5401(90)90032-D","volume":"84","author":"D. Spreen","year":"1990","unstructured":"Spreen, D.: Computable one-to-one enumerations of effective domains. Information and Computation\u00a084(1), 26\u201346 (1990)","journal-title":"Information and Computation"},{"issue":"1","key":"10_CR19","doi-asserted-by":"publisher","first-page":"185","DOI":"10.2307\/2586596","volume":"63","author":"D. Spreen","year":"1998","unstructured":"Spreen, D.: On effective topological spaces. The Journal of Symbolic Logic\u00a063(1), 185\u2013221 (1998)","journal-title":"The Journal of Symbolic Logic"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Spreen, D.: On domains witnessing increase in information. Applied General Topology\u00a01(1) (2000)","DOI":"10.4995\/agt.2000.13640"},{"key":"10_CR21","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1017\/CBO9780511546464.015","volume-title":"Logic Colloquium 2005","author":"D. Spreen","year":"2007","unstructured":"Spreen, D.: On some problems in computable topology. In: Logic Colloquium 2005, pp. 221\u2013254. Cambridge University Press, Cambridge (2007)"},{"key":"10_CR22","unstructured":"Thatcher, J.M.: The construction of a self-describing Turing machine. In: Proc. of the Symposium on Mathematical Theory of Automata, pp. 165\u2013171 (1963)"},{"key":"10_CR23","unstructured":"Thompson, G.P.: The Quine Page (1999), http:\/\/www.nyx.net\/~gthompso\/quine.htm"}],"container-title":["Lecture Notes in Computer Science","Mathematical Theory and Computational Practice"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03073-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,20]],"date-time":"2020-05-20T15:38:59Z","timestamp":1589989139000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03073-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642030727","9783642030734"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03073-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}