TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE (Q4882918)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE |
scientific article; zbMATH DE number 894363
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE |
scientific article; zbMATH DE number 894363 |
Statements
TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE (English)
0 references
14 August 1996
0 references
variety
0 references
finite equational base
0 references
finitely-based algebra
0 references
Turing machine
0 references
0.8443408
0 references
0.8414356
0 references
0.84076285
0 references
0.8397891
0 references
0.8386296
0 references
0 references
0.8373445
0 references
0.8366382
0 references
