TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE
From MaRDI portal
Publication:4882918
Recommendations
- scientific article; zbMATH DE number 2144744
- An undecidable problem in finite combinatorics
- scientific article; zbMATH DE number 4031659
- Decidability and undecidability in the enumerable Turing degrees
- Proof of Recursive Unsolvability of Hilbert's Tenth Problem
- Undecidability, incompleteness and Arnol'd problems
- An undecidable problem in correspondence theory
- Undecidability in Weihrauch degrees
- Some proofs of undecidability of arithmetic
- Recursive unsolvability of a problem of Thue
Cited in
(58)- A survey on varieties generated by small semigroups and a companion website
- Universal algebraic methods for non-classical logics
- Kripke completeness of strictly positive modal logics over meet-semilattices with operators
- Slim groupoids
- A juggler's dozen of easy\(^\dag\) problems (\(^\dag\) Well, easily formulated \dots).
- Quasiequational Theories of Flat Algebras
- Inherently nonfinitely based lattices
- scientific article; zbMATH DE number 3921962 (Why is no real title available?)
- A finite basis theorem for difference-term varieties with a finite residual bound
- On the finite basis problem for the monoids of triangular Boolean matrices.
- PROPERTIES OF VARIETIES DETERMINED BY THE DEGREES OF PROPER HYPERSUBSTITUTIONS
- On the variety generated by the monoid of triangular \(2\times 2\) matrices over a two-element field.
- scientific article; zbMATH DE number 2144744 (Why is no real title available?)
- Lee monoid \(L_4^1\) is non-finitely based
- COMPUTATIONALLY AND ALGEBRAICALLY COMPLEX FINITE ALGEBRA MEMBERSHIP PROBLEMS
- On the finite basis problem for the monoids of partial extensive injective transformations.
- ON THE COMPLEXITY OF SOME MALTSEV CONDITIONS
- The max-plus algebra of the natural numbers has no finite equational basis
- The variety generated by an ai-semiring of order three
- THE TYPE SET OF A VARIETY IS NOT COMPUTABLE
- Finite bases for flat graph algebras
- A finite basis theorem for residually finite, congruence meet-semidistributive varieties
- Constraint satisfaction, irredundant axiomatisability and continuous colouring
- The finite basis problem for endomorphism semirings of finite semilattices with zero.
- Residual smallness relativized to congruence types. I
- On the finite basis problem for certain 2-limited words.
- Recursive inseparability for residual bounds of finite algebras
- Finitary PCF is not decidable
- FINITELY BASED WORDS
- Algebraic properties of some quadratic dynamical systems
- Finitely based, finite sets of words
- The finite basis property of a certain semigroup of upper triangular matrices over a field.
- Nonfinitely based ai-semirings with finitely based semigroup reducts
- The finite basis problem for words with at most two non-linear variables.
- Bases of identities for semigroups of bounded rank transformations of a set.
- Complexity of quasivariety lattices of pointed Abelian groups.
- An undecidable property of recurrent double sequences
- Finite axiomatizability of congruence rich varieties
- Two finitely generated varieties having no infinite simple members
- Semigroups embeddable in hyperplane face monoids.
- THE FINITE BASIS PROBLEM FOR INVOLUTION SEMIGROUPS OF TRIANGULAR MATRICES
- COMPUTATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM FOR VARIETIES
- A NONFINITELY BASED FINITE SEMIRING
- Algebras from finite group actions and a question of Eilenberg and Schützenberger
- Unreasonable lattices of quasivarieties
- Flat unars: the primal, the semi-primal and the dualisable
- The undecidability of the definability of principal subcongruences
- Non-finitely based monoids.
- Finite basis problems and results for quasivarieties
- Flat algebras and the translation of universal Horn logic to equational logic
- Equational theories of semigroups with involution.
- Catalan monoids inherently nonfinitely based relative to finite \(\mathscr{R}\)-trivial semigroups
- Finite degree clones are undecidable
- Dualizability of automatic algebras.
- EQUATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM
- The computational complexity of deciding whether a finite algebra generates a minimal variety
- On finite alphabets and infinite bases
- The finite basis problem for the monoid of two-by-two upper triangular tropical matrices
This page was built for publication: TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4882918)
