Decreasing diagrams with two labels are complete for confluence of countable systems
From MaRDI portal
(Redirected from Publication:4993340)
Recommendations
Cites work
- An introduction to Kolmogorov complexity and its applications
- Confluence by decreasing diagrams
- Confluence by Decreasing Diagrams
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- De Bruijn's weak diamond property revisited
- Degrees of Infinite Words, Polynomials and Atoms
- scientific article; zbMATH DE number 3730111 (Why is no real title available?)
- scientific article; zbMATH DE number 1889386 (Why is no real title available?)
- scientific article; zbMATH DE number 3387326 (Why is no real title available?)
- Least upper bounds on the size of confluence and Church-Rosser diagrams in term rewriting and -calculus
- Levels of undecidability in rewriting
- On theories with a combinatorial definition of 'equivalence'
- The first-order theory of one-step rewriting is undecidable
- The termination hierarchy for term rewriting
- Tree-Manipulating Systems and Church-Rosser Theorems
Cited in
(6)
This page was built for publication: Decreasing diagrams with two labels are complete for confluence of countable systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4993340)
