{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,2]],"date-time":"2025-01-02T11:40:12Z","timestamp":1735818012017,"version":"3.32.0"},"reference-count":26,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2023,7,10]],"date-time":"2023-07-10T00:00:00Z","timestamp":1688947200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["The Review of Symbolic Logic"],"published-print":{"date-parts":[[2024,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We formulate Hilbert\u2019s epsilon calculus in the context of expansion proofs. This leads to a simplified proof of the epsilon theorems by disposing of the need for prenexification, Skolemisation, and their respective inverse transformations. We observe that the natural notion of cut in the epsilon calculus is associative.<\/jats:p>","DOI":"10.1017\/s1755020323000217","type":"journal-article","created":{"date-parts":[[2023,7,10]],"date-time":"2023-07-10T07:04:31Z","timestamp":1688972671000},"page":"1248-1263","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":0,"title":["A SIMPLIFIED PROOF OF THE EPSILON THEOREMS"],"prefix":"10.1017","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6461-5982","authenticated-orcid":false,"given":"STEFAN","family":"HETZL","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2023,7,10]]},"reference":[{"key":"S1755020323000217_r7","doi-asserted-by":"publisher","DOI":"10.2178\/jsl\/1333566645"},{"key":"S1755020323000217_r1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01450016"},{"key":"S1755020323000217_r19","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-018-9453-9"},{"volume-title":"Grundlagen der Mathematik II","year":"1939","author":"Hilbert","key":"S1755020323000217_r17"},{"key":"S1755020323000217_r21","doi-asserted-by":"publisher","DOI":"10.1145\/2422085.2422090"},{"key":"S1755020323000217_r25","first-page":"231","volume-title":"Proofs, Categories and Computations: Essays in Honor of Grigori Mints.","author":"Tait","year":"2010"},{"key":"S1755020323000217_r14","doi-asserted-by":"publisher","DOI":"10.1016\/j.apal.2010.04.006"},{"key":"S1755020323000217_r24","doi-asserted-by":"publisher","DOI":"10.1007\/s11225-006-6610-7"},{"key":"S1755020323000217_r16","unstructured":"[16] Hetzl, S. , & Weller, D. (2013). Expansion trees with cut. Preprint. Available from: http:\/\/arxiv.org\/abs\/1308.0428."},{"key":"S1755020323000217_r4","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129519000069"},{"key":"S1755020323000217_r12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1093\/oso\/9780198536901.001.0001","volume-title":"Arithmetic, Proof Theory and Computational Complexity","author":"Clote","year":"1993"},{"key":"S1755020323000217_r10","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exu030"},{"key":"S1755020323000217_r11","doi-asserted-by":"publisher","DOI":"10.2307\/2266170"},{"key":"S1755020323000217_r13","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/1.4.431"},{"volume-title":"The Stanford Encyclopedia of Philosophy","year":"2020","author":"Avigad","key":"S1755020323000217_r6"},{"key":"S1755020323000217_r2","doi-asserted-by":"publisher","DOI":"10.1017\/jsl.2018.51"},{"key":"S1755020323000217_r8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-72056-2_4"},{"key":"S1755020323000217_r22","doi-asserted-by":"publisher","DOI":"10.1007\/BF00370646"},{"key":"S1755020323000217_r26","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.08.035"},{"key":"S1755020323000217_r23","first-page":"133","article-title":"Thoralf Skolem and the epsilon substitution method for predicate logic","volume":"1","author":"Mints","year":"1996","journal-title":"Nordic Journal of Philosophical Logic"},{"key":"S1755020323000217_r15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40537-2_15"},{"key":"S1755020323000217_r9","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exaa044"},{"key":"S1755020323000217_r3","doi-asserted-by":"publisher","DOI":"10.1007\/BF00252180"},{"key":"S1755020323000217_r18","doi-asserted-by":"publisher","DOI":"10.1016\/S0168-0072(01)00075-6"},{"key":"S1755020323000217_r20","doi-asserted-by":"publisher","DOI":"10.2969\/jmsj\/00740323"},{"key":"S1755020323000217_r5","doi-asserted-by":"publisher","DOI":"10.1145\/772062.772068"}],"container-title":["The Review of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1755020323000217","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,2]],"date-time":"2025-01-02T10:53:30Z","timestamp":1735815210000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1755020323000217\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,10]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["S1755020323000217"],"URL":"https:\/\/doi.org\/10.1017\/s1755020323000217","relation":{},"ISSN":["1755-0203","1755-0211"],"issn-type":[{"type":"print","value":"1755-0203"},{"type":"electronic","value":"1755-0211"}],"subject":[],"published":{"date-parts":[[2023,7,10]]},"assertion":[{"value":"\u00a9 The Author(s), 2023. Published by Cambridge University Press on behalf of The Association for Symbolic Logic","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}}]}}