{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T19:40:32Z","timestamp":1718653232306},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,6,20]],"date-time":"2016-06-20T00:00:00Z","timestamp":1466380800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Period Math Hung"],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s10998-016-0148-x","type":"journal-article","created":{"date-parts":[[2016,6,20]],"date-time":"2016-06-20T08:17:23Z","timestamp":1466410643000},"page":"1-15","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A representation of recursively enumerable sets through Horn formulas in higher recursion theory"],"prefix":"10.1007","volume":"73","author":[{"given":"Juan A.","family":"Nido Valencia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julio E.","family":"Sol\u00eds Daun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luis M.","family":"Villegas Silva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,20]]},"reference":[{"issue":"2","key":"148_CR1","doi-asserted-by":"crossref","first-page":"226","DOI":"10.2307\/2271099","volume":"34","author":"J Barwise","year":"1969","unstructured":"J. Barwise, Infinitary logic and admissible sets. J. Symb. Logic 34(2), 226\u2013252 (1969)","journal-title":"J. Symb. Logic"},{"key":"148_CR2","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 (Springer, Berlin, 1975)"},{"key":"148_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-21723-8","volume-title":"Constructibility","author":"K Devlin","year":"1984","unstructured":"K. Devlin, Constructibility (Springer, Berlin, 1984)"},{"key":"148_CR4","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3133.001.0001","volume-title":"From Logic to Logic Programming","author":"K Doets","year":"1994","unstructured":"K. Doets, From Logic to Logic Programming (MIT Press, Cambridge, 1994)"},{"key":"148_CR5","volume-title":"Fundamentals of Generalized Recursion Theory","author":"M Fitting","year":"1981","unstructured":"M. Fitting, Fundamentals of Generalized Recursion Theory (North Holland, Amsterdam, 1981)"},{"key":"148_CR6","volume-title":"Incompletness in the Land of Sets","author":"M Fitting","year":"2007","unstructured":"M. Fitting, Incompletness in the Land of Sets (College Publications, London, 2007)"},{"key":"148_CR7","first-page":"173","volume":"255","author":"S Friedman","year":"1979","unstructured":"S. Friedman, $$\\beta $$ \u03b2 -Recursion theory. Trans. Am. Math. Soc. 255, 173\u2013200 (1979)","journal-title":"Trans. Am. Math. Soc."},{"issue":"2","key":"148_CR8","doi-asserted-by":"crossref","first-page":"567","DOI":"10.2307\/2586556","volume":"65","author":"J Hamkins","year":"2000","unstructured":"J. Hamkins, A. Lewis, Infinite time turing machines. J. Symb. Logic 65(2), 567\u2013604 (2000)","journal-title":"J. Symb. Logic"},{"key":"148_CR9","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1093\/oso\/9780198537458.003.0007","volume-title":"Handbook of Logic in Artificial Intelligence and Logic Programming","author":"W Hodges","year":"1993","unstructured":"W. Hodges, Logical Features of Horn Clauses, in Handbook of Logic in Artificial Intelligence and Logic Programming, ed. by D. Gabbay, C. Hogger, J. Robinson (Clarendon Press, Oxford, 1993), pp. 449\u2013503"},{"key":"148_CR10","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1090\/pspum\/013.1\/0281602","volume-title":"In Axiomatic Set Theory: Proc. Symp. Pure Math","author":"RB Jensen","year":"1971","unstructured":"R.B. Jensen, C. Karp, Primitive Recursive Set Functions, in In Axiomatic Set Theory: Proc. Symp. Pure Math, ed. by D. Scott (American Mathematical Society, Providence, 1971), pp. 143\u2013167"},{"key":"148_CR11","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0003-4843(72)90001-0","volume":"4","author":"RB Jensen","year":"1972","unstructured":"R.B. Jensen, The fine structure of the constructible hierarchy. Ann. Math. Logic 4, 229\u2013308 (1972)","journal-title":"Ann. Math. Logic"},{"key":"148_CR12","unstructured":"Jensen, R. B. Subcomplete Forcing and $$L$$ L -forcing, Lectures given at the All Summer Scholl in Singapore (2012). Available in http:\/\/www.mathematik.hu-berlin.de\/~raesch\/org\/jensen\/pdf\/Singapore_Lectures_final_version"},{"key":"148_CR13","unstructured":"Koepke, P. $$\\alpha $$ \u03b1 -Recursion Theory and Ordinal Computability, preprint. Available in http:\/\/www.math.uni-bonn.de\/people\/koepke\/preprints.shtml"},{"issue":"3","key":"148_CR14","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1016\/j.apal.2009.01.005","volume":"160","author":"P Koepke","year":"2009","unstructured":"P. Koepke, B. Seyffert, Ordinal machines and admissible recursion theory. Ann. Pure Appl. Logic 160(3), 310\u2013318 (2009)","journal-title":"Ann. Pure Appl. Logic"},{"key":"148_CR15","volume-title":"The Fundations of Mathematics","author":"K Kunen","year":"2009","unstructured":"K. Kunen, The Fundations of Mathematics (College Publications, London, 2009)"},{"key":"148_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0649-1","volume-title":"Logic for Applications","author":"A Nerode","year":"1997","unstructured":"A. Nerode, R. Shore, Logic for Applications, 2nd edn. (Springer, Berlin, 1997)","edition":"2"},{"key":"148_CR17","volume-title":"Higher Recursion Theory","author":"G Sacks","year":"1993","unstructured":"G. Sacks, Higher Recursion Theory (Springer, Berlin, 1993)"},{"key":"148_CR18","volume-title":"In Handbook of Set Theory","author":"R Schindler","year":"2010","unstructured":"R. Schindler, M. Zeman, Fine Structure, in In Handbook of Set Theory, ed. by M. Foreman, A. Kanamori (Springer, Berlin, 2010)"},{"key":"148_CR19","doi-asserted-by":"crossref","DOI":"10.1515\/9781400882007","volume-title":"Theory of Formal Systems","author":"R Smullyan","year":"1961","unstructured":"R. Smullyan, Theory of Formal Systems, Rev. edn. (Princeton University Press, Princeton, 1961)","edition":"Rev."},{"key":"148_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02460-7","volume-title":"Recursively Enumerable Sets and Degrees","author":"RI Soare","year":"1987","unstructured":"R.I. Soare, Recursively Enumerable Sets and Degrees (Springer, Berlin, 1987)"}],"container-title":["Periodica Mathematica Hungarica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10998-016-0148-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10998-016-0148-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10998-016-0148-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T19:17:29Z","timestamp":1718651849000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10998-016-0148-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,20]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["148"],"URL":"https:\/\/doi.org\/10.1007\/s10998-016-0148-x","relation":{},"ISSN":["0031-5303","1588-2829"],"issn-type":[{"value":"0031-5303","type":"print"},{"value":"1588-2829","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6,20]]}}}