{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T18:42:07Z","timestamp":1757616127301,"version":"3.44.0"},"publisher-location":"Cham","reference-count":6,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031087394"},{"type":"electronic","value":"9783031087400"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-08740-0_26","type":"book-chapter","created":{"date-parts":[[2022,6,25]],"date-time":"2022-06-25T14:33:51Z","timestamp":1656167631000},"page":"313-326","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Barendregt\u2019s Problem #26 and\u00a0Combinatory Strong Reduction"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5619-5490","authenticated-orcid":false,"given":"William","family":"Stirton","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,26]]},"reference":[{"key":"26_CR1","unstructured":"Barendregt, H.P.: Problem #26 in a list of open problems maintained by the universit\u00e0 di torino. http:\/\/tlca.di.unito.it\/opltlca\/opltlcasu33.html. Accessed 20 Apr 2022"},{"key":"26_CR2","volume-title":"Combinatory Logic","author":"HB Curry","year":"1972","unstructured":"Curry, H.B., Hindley, J.R., Seldin, J.P.: Combinatory Logic, vol. 2. North-Holland, Amsterdam (1972)"},{"key":"26_CR3","unstructured":"Gentzen, G.: Neue Fassung des Widerspruchsfreiheitsbeweises f\u00fcr die reine Zahlentheorie. Hirzel, Leipzig (1938)"},{"issue":"2","key":"26_CR4","doi-asserted-by":"publisher","first-page":"224","DOI":"10.2307\/2271660","volume":"32","author":"JR Hindley","year":"1967","unstructured":"Hindley, J.R.: Axioms for strong reduction in combinatory logic. J. Symb. Log. 32(2), 224\u2013236 (1967)","journal-title":"J. Symb. Log."},{"key":"26_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809835","volume-title":"Lambda Calculus and Combinators: An Introduction","author":"JR Hindley","year":"2008","unstructured":"Hindley, J.R., Seldin, J.P.: Lambda Calculus and Combinators: An Introduction. Cambridge University Press, Cambridge (2008)"},{"key":"26_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-66473-1","volume-title":"Proof Theory","author":"K Sch\u00fctte","year":"1977","unstructured":"Sch\u00fctte, K.: Proof Theory. Springer, Heidelberg (1977)"}],"container-title":["Lecture Notes in Computer Science","Revolutions and Revelations in Computability"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-08740-0_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T17:17:57Z","timestamp":1757092677000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-08740-0_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031087394","9783031087400"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-08740-0_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"26 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CiE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Computability in Europe","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Swansea","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cie2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cs.swansea.ac.uk\/cie2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}