Unification in permutative equational theories is undecidable
type: Item
instance of: scholarly article
title: Unification in permutative equational theories is undecidable
zbMATH Open document ID: 0684.03019
DOI: 10.1016/S0747-7171(89)80037-9
author: Manfred Schmidt-Schauß
published in: Journal of Symbolic Computation
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 03D35
Mathematics Subject Classification ID: 03C05
Mathematics Subject Classification ID: 68Q65
Mathematics Subject Classification ID: 03D10
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 4120162
zbMATH Keywords: permutative equational theories
zbMATH Keywords: unifiability of terms
zbMATH Keywords: Turing machine
zbMATH Keywords: confluent term-rewriting system
MaRDI profile type: Publication
cites work: Q3779785
cites work: Associative-commutative unification
cites work: An algebraic approach to unification under associativity and commutativity
cites work: Unification in abelian semigroups
cites work: Q3883561
cites work: Q3862379
cites work: Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
cites work: Q3703312
cites work: Completion of a Set of Rules Modulo a Set of Equations
cites work: New decision algorithms for finitely presented commutative semigroups
cites work: Q5581665
cites work: A Machine-Oriented Logic Based on the Resolution Principle
cites work: Unification theory
cites work: A Unification Algorithm for Associative-Commutative Functions
cites work: Q3313256
description: scientific article; zbMATH DE number 4120162