Skip to main content
    • Aa
    • Aa
  • Get access
    Check if you have access via personal or institutional login
  • Cited by 6
  • Cited by
    This article has been cited by the following publications. This list is generated based on data provided by CrossRef.

    Barto, Libor and Kazda, Alexandr 2016. Deciding absorption. International Journal of Algebra and Computation, p. 1.

    Horowitz, Jonah 2015. Testing for edge terms is decidable. Algebra universalis, Vol. 73, Issue. 3-4, p. 321.

    Kerkhoff, Sebastian Pöschel, Reinhard and Schneider, Friedrich Martin 2014. A Short Introduction to Clones. Electronic Notes in Theoretical Computer Science, Vol. 303, p. 107.

    Zhuk, Dmitriy N. 2014. The existence of a near-unanimity function is decidable. Algebra universalis, Vol. 71, Issue. 1, p. 31.

    Loten, Cynthia and Tardif, Claude 2011. Near-Unanimity Polymorphisms on Structures with Finite Duality. SIAM Journal on Discrete Mathematics, Vol. 25, Issue. 2, p. 490.

    Idziak, PaweŁ Marković, Petar McKenzie, Ralph Valeriote, Matthew and Willard, Ross 2010. Tractability and Learnability Arising from Algebras with Few Subpowers. SIAM Journal on Computing, Vol. 39, Issue. 7, p. 3023.


The existence of a near-unanimity term in a finite algebra is decidable

  • Miklós Maróti (a1)
  • DOI:
  • Published online: 01 March 2014

We prove that it is decidable of a finite algebra whether it has a near-unanimity term operation, which settles a ten-year-old problem. As a consequence, it is decidable of a finite algebra in a congruence distributive variety whether it admits a natural duality.

Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

[1]K. A. Baker and A. F. Pixley , Polynomial interpolation and the Chinese remainder theorem, Mathematische Zeitschrift, vol. 143 (1975), pp. 165174.

[2]A. Bulatov , A. A. Krokhin , and P. Jeavons , Constraint satisfaction problems and finite algebras, Lecture Notes in Computer Science, vol. 1853 (2000), pp. 272282.

[3]B. A. Davey , L. Heindorf , and R. McKenzie , Near unanimity: an obstacle to general duality theory, Algebra Universalis, vol. 33 (1995), pp. 428439.

[5]T. Feder and M. Y. Vardi , The computational structure of monotone monadic SNP and constraint satisfaction: A study through datalog and group theory, SIAM Journal of Computing, vol. 28 (1998), no. 1, pp. 57104.

[7]P. Jeavons , D. Cohen , and M. C. Cooper , Constraints, consistency and closure, Artificial Intelligence, vol. 101 (1998), pp. 251265.

[9]L. Lovász , Kneser's conjecture, chromatic numbers and homotopy, Journal of Combinatorial Theory, Series A, vol. 25 (1978), pp. 319324.

[10]M. Maróti , On the (un) decidability of a near-unanimity term, Algebra Universalis, vol. 57 (2007), no. 2, pp. 215237.

[11]M. Maróti and R. McKenzie , Existence theorems for weakly symmetric operations, Algebra Universalis, vol. 59 (2008), no. 3-4, pp. 463489.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Journal of Symbolic Logic
  • ISSN: 0022-4812
  • EISSN: 1943-5886
  • URL: /core/journals/journal-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *