Omega-termination is undecidable for totally terminating term rewriting systems

Abstract: "We give complete proof of the fact that the following problem is undecidable: Given: A term rewriting system, where the termination of its rewrite relation is provable by a total reduction order on ground terms, Wanted: Does there exist a strictly monotonic interpretation in the posi...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
1. Verfasser:	Geser, Alfons (VerfasserIn)
Format:	UnknownFormat
Sprache:	eng
Veröffentlicht:	Passau 1996
Schriftenreihe:	Universität <Passau> / Fakultät für Mathematik und Informatik: MIP 1996,08
Schlagworte:	Decidability (Mathematical logic) > Rewriting systems (Computer science) > Informatik > Mathematik > Theoretische Informatik
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Bestellen

Beschreibung
Zusammenfassung:	Abstract: "We give complete proof of the fact that the following problem is undecidable: Given: A term rewriting system, where the termination of its rewrite relation is provable by a total reduction order on ground terms, Wanted: Does there exist a strictly monotonic interpretation in the positive integers that proves termination?"
Beschreibung:	17, 4 S.