<div class="csl-bib-body">
<div class="csl-entry">Hetzl, S., & Strassburger, L. (2013). Herbrand-Confluence. <i>Logical Methods in Computer Science</i>, <i>9</i>(4). https://doi.org/10.2168/LMCS-9(4:24)2013</div>
</div>
-
dc.identifier.issn
1860-5974
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/156025
-
dc.description.abstract
We consider cut-elimination in the sequent calculus for classical first-order logic. It is well known that this system, in its most general form, is neither confluent nor strongly normalizing. In this work we take a coarser (and mathematically more realistic) look at cut-free proofs. We analyze which witnesses they choose for which quantifiers, or in other words: we only consider the Herbrand-disjunction of a cut-free proof. Our main theorem is a confluence result for a natural class of proofs: all (possibly infinitely many) normal forms of the non-erasing reduction lead to the same Herbrand-disjunction.
en
dc.language.iso
en
-
dc.relation.ispartof
Logical Methods in Computer Science
-
dc.subject
Computer Science
en
dc.subject
semantics of proofs
en
dc.subject
proof theory
en
dc.subject
first-order logic
en
dc.subject
tree languages
en
dc.subject
term rewriting
en
dc.title
Herbrand-Confluence
en
dc.type
Artikel
de
dc.type
Article
en
dc.contributor.affiliation
Inria Saclay - Île-de-France Research Centre, France
-
dc.type.category
Original Research Article
-
tuw.container.volume
9
-
tuw.container.issue
4
-
tuw.journal.peerreviewed
true
-
tuw.peerreviewed
true
-
wb.publication.intCoWork
International Co-publication
-
tuw.researchTopic.id
C5
-
tuw.researchTopic.name
Computer Science Foundations
-
tuw.researchTopic.value
100
-
dcterms.isPartOf.title
Logical Methods in Computer Science
-
tuw.publication.orgunit
E192-05 - Forschungsbereich Theory and Logic
-
tuw.publisher.doi
10.2168/LMCS-9(4:24)2013
-
dc.identifier.eissn
1860-5974
-
dc.description.numberOfPages
25
-
wb.sci
true
-
wb.sciencebranch
Informatik
-
wb.sciencebranch.oefos
1020
-
item.languageiso639-1
en
-
item.openairetype
research article
-
item.grantfulltext
none
-
item.fulltext
no Fulltext
-
item.cerifentitytype
Publications
-
item.openairecristype
http://purl.org/coar/resource_type/c_2df8fbb1
-
crisitem.author.dept
E104-02 - Forschungsbereich Computational Logic
-
crisitem.author.orcid
0000-0002-6461-5982
-
crisitem.author.parentorg
E104 - Institut für Diskrete Mathematik und Geometrie
