A New Method for Undecidability Proofs of First Order Theories

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

by Ralf Treinen

Venue:	Journal of Symbolic Computation
Citations:	30 - 7 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	A New Method for Undecidability Proofs of First Order Theories	user correction - Legacy Corrections
AUTHOR NAME	Ralf Treinen	SVM HeaderParse 0.2
AUTHOR ADDR	DFKI, Stuhlsatzenhausweg 3, W6600 Saarbrucken, Germany	SVM HeaderParse 0.2
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	user correction - Legacy Corrections
YEAR	1992	INFERENCE
VENUE	Journal of Symbolic Computation	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
VOLUME	14	INFERENCE
TECH	Tech. Report A-09/90	INFERENCE
CITATIONS	36 found	ParsCit 1.0