TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE
type: Item
instance of: scholarly article
title: TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE
zbMATH Open document ID: 0844.08011
DOI: 10.1142/S0218196796000040
author: Ralph McKenzie
published in: International Journal of Algebra and Computation
publication date: 1996-08-14T00:00:00Z
Mathematics Subject Classification ID: 08B99
Mathematics Subject Classification ID: 03B25
zbMATH DE Number: 894363
zbMATH Keywords: variety
zbMATH Keywords: finite equational base
zbMATH Keywords: finitely-based algebra
zbMATH Keywords: Turing machine
MaRDI profile type: MaRDI publication profile
Recommended article: Q4657024
Recommended article: An undecidable problem in finite combinatorics
Recommended article: Q3772198
Recommended article: Decidability and undecidability in the enumerable Turing degrees
Recommended article: Proof of Recursive Unsolvability of Hilbert's Tenth Problem
Recommended article: Undecidability, incompleteness and Arnol'd problems
Recommended article: An undecidable problem in correspondence theory
Recommended article: Undecidability in Weihrauch Degrees
Recommended article: Some proofs of undecidability of arithmetic
Recommended article: Recursive Unsolvability of a problem of Thue
description: scientific article; zbMATH DE number 894363