Constructive Many-one Reduction from the Halting Problem to Semi-unification (Extended Version)

Semi-unification is the combination of first-order unification and first-order matching. The undecidability of semi-unification has been proven by Kfoury, Tiuryn, and Urzyczyn in the 1990s by Turing reduction from Turing machine immortality (existence of a diverging configuration). The particular Tu...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Logical methods in computer science Jg. 19, Issue 4
1. Verfasser:	Dudenhefner, Andrej
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Logical Methods in Computer Science e.V 08.12.2023
Schlagworte:	computer science - logic in computer science
ISSN:	1860-5974, 1860-5974
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!