The existence of a near-unanimity function is decidable (Q2449447): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Polynomial interpolation and the Chinese remainder theorem for algebraic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finitely Related Algebras In Congruence Distributive Varieties Have Near Unanimity Terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order varieties and monotone retractions of finite posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closed systems of functions and predicates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraints, consistency and closure / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm for near-unanimity graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the (un)decidability of a near-unanimity term / rank
 
Normal rank
Property / cites work
 
Property / cites work: The existence of a near-unanimity term in a finite algebra is decidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure of clones in the precomplete class of self-dual functions in three-valued logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cardinality of the set of all clones containing a given minimal clone on three elements / rank
 
Normal rank

Latest revision as of 12:38, 8 July 2024

scientific article
Language Label Description Also known as
English
The existence of a near-unanimity function is decidable
scientific article

    Statements

    The existence of a near-unanimity function is decidable (English)
    0 references
    0 references
    8 May 2014
    0 references
    0 references
    decidability
    0 references
    near-unanimity
    0 references
    relational structure
    0 references
    essential predicate
    0 references
    0 references
    0 references