Relative undecidability in term rewriting

DOI10.1007/3-540-63172-0_37MaRDI QIDQ4362915zbMATH OpenFDO

Authors Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema

Publication date 1 April 1998

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://dspace.library.uu.nl/handle/1874/18351

zbMATH Keywords

relative undecidability

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Relative undecidability in term rewriting. I: The termination hierarchy
• Relative undecidability in term rewriting. II: The confluence hierarchy
• Levels of undecidability in rewriting

Cited in

(12)

• The undecidability of self-embedding for term rewriting systems
• Relative undecidability in term rewriting. I: The termination hierarchy
• Relative undecidability in term rewriting. II: The confluence hierarchy
• Total termination of term rewriting is undecidable
• The \Pi^0_2 -Completeness of Most of the Properties of Rewriting Systems You Care About (and Productivity)
• Degrees of Undecidability in Term Rewriting
• scientific article; zbMATH DE number 465525 (Why is no real title available?)
• New Undecidability Results for Properties of Term Rewrite Systems
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Unique normal form property of compatible term rewriting systems: A new proof of Chew's theorem
• Levels of undecidability in rewriting
• Undecidable properties of flat term rewrite systems

This page was built for publication: Relative undecidability in term rewriting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4362915)