Leanest Quasi-orderings: Preliminary Version

A convenient method for defining a quasi-ordering, such as those used for proving termination of rewriting, is to choose the minimum of a set of quasi-orderings satisfying some desired traits. Unfortunately, a minimum in terms of set inclusion can be non-existent even when an intuitive “minimum” exi...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Dershowitz, Nachum, Ellerman, E. Castedo
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Applied sciences Computer science control theory systems Exact sciences and technology Language theory and syntactical analysis Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!