Tarski’s finite basis problem via 𝐀(𝒯)

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

Ross Willard

Publication date: 27 May 1997

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

Full work available at URL: https://doi.org/10.1090/s0002-9947-97-01807-2

zbMATH Keywords

Turing machinefinite algebraequational theoryfinite basis problemfinitely axiomatizable

Mathematics Subject Classification ID

Equational logic, Mal'tsev conditions (08B05) Equational classes, universal algebra in model theory (03C05) Turing machines and related notions (03D10)

Related Items (10)

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

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

This page was built for publication: Tarski’s finite basis problem via 𝐀(𝒯)