A new method for undecidability proofs of first order theories
type: Item
instance of: scholarly article
title: A new method for undecidability proofs of first order theories
zbMATH Open document ID: 0769.03026
DOI: 10.1016/0747-7171(92)90016-W
author: Ralf Treinen
published in: Journal of Symbolic Computation
publication date: 1993-05-16T00:00:00Z
Mathematics Subject Classification ID: 03D35
Mathematics Subject Classification ID: 03B25
zbMATH DE Number: 168217
zbMATH Keywords: Post's Correspondence Problem
zbMATH Keywords: decision problem
zbMATH Keywords: undecidability of first order theories
zbMATH Keywords: term algebra
zbMATH Keywords: partial lexicographic path ordering
MaRDI profile type: Publication
cites work: Q4264733
cites work: On equational theories, unification, and (un)decidability
cites work: Equational problems and disunification
cites work: SOLVING SYMBOLIC ORDERING CONSTRAINTS
cites work: Fundamental properties of infinite trees
cites work: Q4385532
cites work: Orderings for term-rewriting systems
cites work: Termination of rewriting
cites work: Q3221381
cites work: Q4052071
cites work: Associative-commutative unification
cites work: Q3720554
cites work: Q3743300
cites work: Q4036585
cites work: Q5613949
cites work: Q5678447
cites work: A variant of a recursively unsolvable problem
cites work: Concatenation as a basis for arithmetic
cites work: Q5586299
cites work: Q5573961
cites work: Q4385529
cites work: Unification theory
cites work: A Unification Algorithm for Associative-Commutative Functions
cites work: Undecidable theories
full work available at URL: 0747-7171(92)90016-w
OpenAlex ID: W2011437767
description: scientific article; zbMATH DE number 168217