## A New Method for Undecidability Proofs of First Order Theories (1992)

by
Ralf Treinen

Venue: | Journal of Symbolic Computation |

Citations: | 29 - 6 self |

### BibTeX

@ARTICLE{Treinen92anew,

author = {Ralf Treinen},

title = {A New Method for Undecidability Proofs of First Order Theories},

journal = {Journal of Symbolic Computation},

year = {1992},

volume = {14}

}

### Years of Citing Articles

### OpenURL

### Abstract

this paper is to define a framework for such reduction proofs. The method proposed is illustrated by proving the undecidability of the theory of a term algebra modulo the axioms of associativity and commutativity and of the theory of a partial lexicographic path ordering. 1. Introduction