Tarski’s finite basis problem via 𝐀(𝒯)

DOI10.1090/S0002-9947-97-01807-2zbMath0870.03010MaRDI QIDQ4337957

Ross Willard

Publication date: 27 May 1997

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

Turing machine; finite algebra; equational theory; finite basis problem; finitely axiomatizable

Mathematics Subject Classification ID

08B05: Equational logic, Mal'tsev conditions

03C05: Equational classes, universal algebra in model theory

03D10: Turing machines and related notions

Related Items

THE TYPE SET OF A VARIETY IS NOT COMPUTABLE, A finite basis theorem for residually finite, congruence meet-semidistributive varieties, The Division Relation: Congruence Conditions and Axiomatisability, THE UNDECIDABILITY OF THE DEFINABILITY OF PRINCIPAL SUBCONGRUENCES, Inherently nonfinitely based lattices, Finite basis problems and results for quasivarieties, The variety generated by \(\mathbb {A}(\mathcal {T})\) -- two counterexamples, Recursive inseparability for residual bounds of finite algebras, COMPUTATIONALLY AND ALGEBRAICALLY COMPLEX FINITE ALGEBRA MEMBERSHIP PROBLEMS, EQUATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM

Cites Work

• Unnamed Item
• Problems and results in tame congruence theory. A survey of the '88 Budapest workshop
• Finite equational bases for finite algebras in a congruence-distributive equational class
• Para primal varieties: A study of finite axiomatizability and definable principal congruences in locally finite varieties
• Unsolvable problems for equational theories
• The structure of finite algebras