TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE
From MaRDI portal
Publication:4882918
DOI10.1142/S0218196796000040zbMath0844.08011MaRDI QIDQ4882918
Publication date: 14 August 1996
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Related Items (54)
Inherently nonfinitely based lattices ⋮ FINITELY BASED WORDS ⋮ THE TYPE SET OF A VARIETY IS NOT COMPUTABLE ⋮ UNREASONABLE LATTICES OF QUASIVARIETIES ⋮ The finite basis problem for words with at most two non-linear variables. ⋮ ON THE VARIETY GENERATED BY THE MONOID OF TRIANGULAR 2×2 MATRICES OVER A TWO-ELEMENT FIELD ⋮ On the finite basis problem for the monoids of partial extensive injective transformations. ⋮ THE FINITE BASIS PROBLEM FOR THE MONOID OF TWO-BY-TWO UPPER TRIANGULAR TROPICAL MATRICES ⋮ Finite axiomatizability of congruence rich varieties ⋮ Constraint satisfaction, irredundant axiomatisability and continuous colouring ⋮ Flat unars: the primal, the semi-primal and the dualisable ⋮ The computational complexity of deciding whether a finite algebra generates a minimal variety ⋮ A survey on varieties generated by small semigroups and a companion website ⋮ A NONFINITELY BASED FINITE SEMIRING ⋮ COMPUTATIONALLY AND ALGEBRAICALLY COMPLEX FINITE ALGEBRA MEMBERSHIP PROBLEMS ⋮ Universal algebraic methods for non-classical logics ⋮ On the finite basis problem for certain 2-limited words. ⋮ Algebras from finite group actions and a question of Eilenberg and Schützenberger ⋮ Catalan monoids inherently nonfinitely based relative to finite \(\mathscr{R}\)-trivial semigroups ⋮ Equational theories of semigroups with involution. ⋮ On the finite basis problem for the monoids of triangular Boolean matrices. ⋮ PROPERTIES OF VARIETIES DETERMINED BY THE DEGREES OF PROPER HYPERSUBSTITUTIONS ⋮ Dualizability of automatic algebras. ⋮ FINITELY BASED, FINITE SETS OF WORDS ⋮ Recursive inseparability for residual bounds of finite algebras ⋮ On finite alphabets and infinite bases ⋮ Semigroups embeddable in hyperplane face monoids. ⋮ Flat algebras and the translation of universal Horn logic to equational logic ⋮ A juggler's dozen of easy\(^\dag\) problems (\(^\dag\) Well, easily formulated \dots). ⋮ Lee monoid \(L_4^1\) is non-finitely based ⋮ Two finitely generated varieties having no infinite simple members ⋮ Bases of identities for semigroups of bounded rank transformations of a set. ⋮ Complexity of quasivariety lattices of pointed Abelian groups. ⋮ Algebraic properties of some quadratic dynamical systems ⋮ Finite basis problems and results for quasivarieties ⋮ COMPUTATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM FOR VARIETIES ⋮ Residual smallness relativized to congruence types. I ⋮ A finite basis theorem for difference-term varieties with a finite residual bound ⋮ EQUATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM ⋮ Finite bases for flat graph algebras ⋮ A finite basis theorem for residually finite, congruence meet-semidistributive varieties ⋮ Quasiequational Theories of Flat Algebras ⋮ Slim groupoids ⋮ ON THE COMPLEXITY OF SOME MALTSEV CONDITIONS ⋮ THE FINITE BASIS PROBLEM FOR INVOLUTION SEMIGROUPS OF TRIANGULAR MATRICES ⋮ Non-finitely based monoids. ⋮ The finite basis property of a certain semigroup of upper triangular matrices over a field ⋮ KRIPKE COMPLETENESS OF STRICTLY POSITIVE MODAL LOGICS OVER MEET-SEMILATTICES WITH OPERATORS ⋮ THE VARIETY GENERATED BY AN AI-SEMIRING OF ORDER THREE ⋮ Nonfinitely based ai-semirings with finitely based semigroup reducts ⋮ THE UNDECIDABILITY OF THE DEFINABILITY OF PRINCIPAL SUBCONGRUENCES ⋮ The finite basis problem for endomorphism semirings of finite semilattices with zero. ⋮ Finite degree clones are undecidable ⋮ The max-plus algebra of the natural numbers has no finite equational basis
This page was built for publication: TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE
