Finitely related clones and algebras with cube terms. (Q438817): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11083-011-9232-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2054605362 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic terms for \(\text{SD}_{\vee}\) varieties revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Varieties with few subalgebras of powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite degree: algebras in general and semigroups in particular / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3775604 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractability and Learnability Arising from Algebras with Few Subpowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Few subpowers, congruence distributivity and near-unanimity terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Subalgebra Intersection Property for Congruence Distributive Varieties / rank
 
Normal rank

Latest revision as of 12:55, 5 July 2024

scientific article
Language Label Description Also known as
English
Finitely related clones and algebras with cube terms.
scientific article

    Statements

    Finitely related clones and algebras with cube terms. (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    31 July 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    finite idempotent algebras
    0 references
    finitely related clones
    0 references
    cube terms
    0 references
    algebras with few subpowers
    0 references
    Valeriote conjecture
    0 references
    polynomial-time algorithms
    0 references
    0 references