scientific article; zbMATH DE number 7199582
From MaRDI portal
Publication:5109511
Jörg Endrullis, Jan Willem Klop, Roy Overbeek
Publication date: 12 May 2020
Full work available at URL: https://arxiv.org/abs/1901.10773
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Levels of undecidability in rewriting
- Elements of finite model theory.
- De Bruijn's weak diamond property revisited
- The first-order theory of linear one-step rewriting is undecidable
- Confluence by decreasing diagrams
- Jumping and escaping: modular termination and the abstract path ordering
- Confluence by critical pair analysis revisited
- Tools and algorithms for the construction and analysis of systems. 25 years of TACAS: TOOLympics, held as part of ETAPS 2019, Prague, Czech Republic, April 6--11, 2019. Proceedings. Part III
- On theories with a combinatorial definition of 'equivalence'
- Degrees of Infinite Words, Polynomials and Atoms
- Experimental Descriptive Complexity
- Least upper bounds on the size of confluence and church-rosser diagrams in term rewriting and λ-calculus
- Degrees of Transducibility
- Confluence by Decreasing Diagrams
- Degrees of Undecidability in Term Rewriting
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Decreasing diagrams with two labels are complete for confluence of countable systems
- Triangulation in rewriting
- Tree-Manipulating Systems and Church-Rosser Theorems
- An introduction to Kolmogorov complexity and its applications
- Logic and structure.
