A Note on a Unifying Proof of the Undecidability of Several Diagrammatic Properties of Term Rewriting Systems

10/21/2019
by   António Malheiro, et al.
0

In this note we give a simple unifying proof of the undecidability of several diagrammatic properties of term rewriting systems that include: local confluence, strong confluence, diamond property, subcommutative property, and the existence of successor. The idea is to code configurations of Turing Machines into terms, and then define a suitable relation on those terms such that the termination of the Turing Machine becomes equivalent to the satisfiability of the diagrammatic property.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/28/2017

Encoding Turing Machines into the Deterministic Lambda-Calculus

This note is about encoding Turing machines into the lambda-calculus....
research
04/10/2023

The Kraft–Barmpalias–Lewis-Pye lemma revisited

This note provides a simplified exposition of the proof of hierarchical ...
research
10/13/2022

A Relational Macrostate Theory Guides Artificial Intelligence to Learn Macro and Design Micro

The high-dimesionality, non-linearity and emergent properties of complex...
research
08/19/2021

Prof. Schönhage's Mysterious Machines

We give a simple Schönhage Storage Modification Machine that simulates o...
research
02/18/2002

A note on Darwiche and Pearl

It is shown that Darwiche and Pearl's postulates imply an interesting pr...
research
01/30/2019

On properties of B-terms

B-terms are built from the B combinator alone defined by B≡λ f.λ g.λ x. ...
research
06/29/2022

On the relation of order theory and computation in terms of denumerability

Computability on uncountable sets has no standard formalization, unlike ...

Please sign up or login with your details

Forgot password? Click here to reset