{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:34:37Z","timestamp":1753889677934,"version":"3.41.2"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2013,12,18]],"date-time":"2013-12-18T00:00:00Z","timestamp":1387324800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"funder":[{"name":"Austrian Science Fund","award":["P 25160"],"award-info":[{"award-number":["P 25160"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>We consider cut-elimination in the sequent calculus for classical first-order\nlogic. It is well known that this system, in its most general form, is neither\nconfluent nor strongly normalizing. In this work we take a coarser (and\nmathematically more realistic) look at cut-free proofs. We analyze which\nwitnesses they choose for which quantifiers, or in other words: we only\nconsider the Herbrand-disjunction of a cut-free proof. Our main theorem is a\nconfluence result for a natural class of proofs: all (possibly infinitely many)\nnormal forms of the non-erasing reduction lead to the same\nHerbrand-disjunction.<\/jats:p>","DOI":"10.2168\/lmcs-9(4:24)2013","type":"journal-article","created":{"date-parts":[[2014,7,15]],"date-time":"2014-07-15T09:37:51Z","timestamp":1405417071000},"source":"Crossref","is-referenced-by-count":2,"title":["Herbrand-Confluence"],"prefix":"10.46298","volume":"Volume 9, Issue 4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6461-5982","authenticated-orcid":false,"given":"Stefan","family":"Hetzl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lutz","family":"Stra\u00dfburger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2013,12,18]]},"reference":[{"key":"845:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/727\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/727\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T19:54:44Z","timestamp":1681242884000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/727"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,18]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-9(4:24)2013","relation":{"is-same-as":[{"id-type":"arxiv","id":"1310.8156","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1310.8156","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2013,12,18]]},"article-number":"727"}}