A finitely based theory of a non-trivial language, with exactly \(\aleph_ 0\) subcovers (Q1894550)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 780792
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A finitely based theory of a non-trivial language, with exactly \(\aleph_ 0\) subcovers |
scientific article; zbMATH DE number 780792 |
Statements
A finitely based theory of a non-trivial language, with exactly \(\aleph_ 0\) subcovers (English)
0 references
21 September 1995
0 references
Let \(L = \langle f,g \rangle\) be an algebraic language with two unary operation symbols (that is, a first-order language with equality and no relation symbols). The author proves that the equational theory of \(L\) based on a single equation \(fv_0 = v_0\) covers exactly \(\aleph_0\) other equational theories of \(L\).
0 references
equational theory
0 references
0.8154104948043823
0 references
0.794159471988678
0 references
0.791526734828949
0 references
0.7727990746498108
0 references
0.7485154271125793
0 references
