Levels of undecidability in rewriting

Abstract

Undecidability of various properties of first order term rewriting systems is well-known. An undecidable property can be classified by the complexity of the formula defining it. This classification gives rise to a hierarchy of distinct levels of undecidability, starting from the arithmetical hierarchy classifying properties using first order arithmetical… (More)
DOI: 10.1016/j.ic.2010.09.003

Topics

1 Figure or Table

Slides referencing similar topics