The undecidability of the first-order theories of one step rewriting in linear canonical systems
From MaRDI portal
Publication:1854538
DOI10.1006/inco.2002.3151zbMath1012.03014MaRDI QIDQ1854538
Publication date: 14 January 2003
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/813be69e3c8bf195d06f595699bf9cf681c7f257
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Automata for reduction properties solving
- Semantic confluence tests and completion methods
- Undecidability of the first order theory of one-step right ground rewriting
- The first-order theory of one step rewriting in linear noetherian systems is undecidable
- Encompassment properties and automata with constraints
- More problems in rewriting
- The first-order theory of one-step rewriting is undecidable
- Concatenation as a basis for arithmetic