{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:29:45Z","timestamp":1742912985996,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030367541"},{"type":"electronic","value":"9783030367558"}],"license":[{"start":{"date-parts":[[2019,12,20]],"date-time":"2019-12-20T00:00:00Z","timestamp":1576800000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-36755-8_10","type":"book-chapter","created":{"date-parts":[[2019,12,16]],"date-time":"2019-12-16T15:05:16Z","timestamp":1576508716000},"page":"144-155","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Feedback Hyperjump"],"prefix":"10.1007","author":[{"given":"Robert S.","family":"Lubarsky","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,12,20]]},"reference":[{"key":"10_CR1","unstructured":"Ackerman, N., Freer, C., Lubarsky, R.: Feedback turing computability, and turing computability as feedback. In: Proceedings of LICS 2015, Kyoto, Japan (2015). http:\/\/math.fau.edu\/lubarsky\/pubs.html"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Ackerman, N., Freer, C., Lubarsky, R.: An introduction to feedback turing computability. J. Log. Comput., special issue on LFCS \u201916 (2020, submitted). http:\/\/math.fau.edu\/lubarsky\/pubs.html","DOI":"10.1093\/logcom\/exaa002"},{"key":"10_CR3","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"Rudiments of $$\\mu $$-Calculus","author":"A Arnold","year":"2001","unstructured":"Arnold, A., Niwinski, D.: Rudiments of $$\\mu $$-Calculus. Studies in Logic and the Foundations of Mathematics, vol. 146. North Holland, Amsterdam (2001)"},{"key":"10_CR4","series-title":"Perspectives in Mathematical Logic","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-11035-5","volume-title":"Admissible Sets and Structures","author":"J Barwise","year":"1975","unstructured":"Barwise, J.: Admissible Sets and Structures. Perspectives in Mathematical Logic. Springer, Berlin (1975)"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0003-4843(79)90025-1","volume":"17","author":"R Gostanian","year":"1979","unstructured":"Gostanian, R.: The next admissible ordinal. Ann. Math. Log. 17, 171\u2013203 (1979)","journal-title":"Ann. Math. Log."},{"key":"10_CR6","first-page":"1","volume":"91","author":"SC Kleene","year":"1959","unstructured":"Kleene, S.C.: Recursive functionals and quantifiers of finite types I. Trans. Am. Math. Soc. 91, 1\u201353 (1959)","journal-title":"Trans. Am. Math. Soc."},{"issue":"1","key":"10_CR7","doi-asserted-by":"publisher","first-page":"291","DOI":"10.2307\/2275338","volume":"58","author":"R Lubarsky","year":"1993","unstructured":"Lubarsky, R.: $$\\mu $$-definable sets of integers. J. Symb. Log. 58(1), 291\u2013313 (1993)","journal-title":"J. Symb. Log."},{"key":"10_CR8","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1515\/9783110324907.341","volume-title":"Ways of Proof Theory","author":"R Lubarsky","year":"2010","unstructured":"Lubarsky, R.: ITTMs with feedback. In: Schindler, R. (ed.) Ways of Proof Theory, pp. 341\u2013354. Ontos, Frankfurt (2010). http:\/\/math.fau.edu\/lubarsky\/pubs.html"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-319-27683-0_17","volume-title":"Logical Foundations of Computer Science","author":"RS Lubarsky","year":"2016","unstructured":"Lubarsky, R.S.: Parallel feedback turing computability. In: Artemov, S., Nerode, A. (eds.) LFCS 2016. LNCS, vol. 9537, pp. 236\u2013250. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-27683-0_17"},{"key":"10_CR10","volume-title":"Descriptive Set Theory","author":"Y Moschovakis","year":"1987","unstructured":"Moschovakis, Y.: Descriptive Set Theory, 1st edn. North Holland, Amsterdam (1987). 2nd edn. AMS (2009)","edition":"1"},{"key":"10_CR11","first-page":"301","volume-title":"Generalized Recursion Theory","author":"W Richter","year":"1974","unstructured":"Richter, W., Aczel, P.: Inductive definitions and reflecting properties of admissible ordinals. In: Fenstad, J.E., Hinman, P.G. (eds.) Generalized Recursion Theory, pp. 301\u2013381. North-Holland, Amsterdam (1974)"},{"key":"10_CR12","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H Rogers","year":"1967","unstructured":"Rogers, H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York (1967)"},{"key":"10_CR13","series-title":"Perspectives in Mathematical Logic","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-12013-2","volume-title":"Higher Recursion Theory","author":"G Sacks","year":"1990","unstructured":"Sacks, G.: Higher Recursion Theory. Perspectives in Mathematical Logic. Springer, Berlin (1990)"},{"issue":"1","key":"10_CR14","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0168-0072(89)90066-3","volume":"42","author":"K Tanaka","year":"1989","unstructured":"Tanaka, K.: The Galvin-Prikry theorem and set existence axioms. Ann. Pure Appl. Log. 42(1), 81\u2013104 (1989)","journal-title":"Ann. Pure Appl. Log."},{"issue":"1\u20132","key":"10_CR15","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0168-0072(91)90045-N","volume":"52","author":"K Tanaka","year":"1991","unstructured":"Tanaka, K.: Weak axioms of determinacy and subsystems of analysis II ($$\\Sigma ^0_2$$ games). Ann. Pure Appl. Log. 52(1\u20132), 181\u2013193 (1991)","journal-title":"Ann. Pure Appl. Log."},{"key":"10_CR16","unstructured":"Welch, P.: G$$_{\\delta \\sigma }$$-games and generalized computation (to appear)"}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-36755-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,8]],"date-time":"2022-10-08T16:06:28Z","timestamp":1665245188000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-36755-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,20]]},"ISBN":["9783030367541","9783030367558"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-36755-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019,12,20]]},"assertion":[{"value":"20 December 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LFCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Logical Foundations of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Deerfield Beach, FL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 January 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 January 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lfcs2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lfcs.ws.gc.cuny.edu\/lfcs-2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"57% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}