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

Journal of Symbolic Logic 74 (3):1001-1014 (2009)
  Copy   BIBTEX

Abstract

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

Categories

Keywords

Reprint years

DOI

10.2178/jsl/1245158096

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,795

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Decision Problems for Equational Theories of Relation Algebras.H. Andréka, Steven R. Givant & I. Németi - 1997 - American Mathematical Soc..
Decidability Of Classes Of Finite Algebras With A Distinguished Subset Closed Under A Discriminator Clone.Jerzy Hanusek - 1996 - Reports on Mathematical Logic:65-82.
A Finite Basis Theorem For Residually Finite, Congruence Meet-semidistributive Varieties.Ross Willard - 2000 - Journal of Symbolic Logic 65 (1):187-200.
On Solvable Congruences in Finitely Decidable Varieties.Matthew A. Valeriote - 1994 - Mathematical Logic Quarterly 40 (3):398-414.
The finite model property for knotted extensions of propositional linear logic.C. J. van Alten - 2005 - Journal of Symbolic Logic 70 (1):84-98.
Decidability and Boolean Representations.Stanley Burris & Ralph McKenzie - 1981 - American Mathematical Soc..
Deciding active structural completeness.Michał M. Stronkowski - 2020 - Archive for Mathematical Logic 59 (1-2):149-165.
On decidability of amenability in computable groups.Karol Duda & Aleksander Ivanov - 2022 - Archive for Mathematical Logic 61 (7):891-902.
Finite algebras of relations are representable on finite sets.H. Andreka, I. Hodkinson & I. Nemeti - 1999 - Journal of Symbolic Logic 64 (1):243-267.
Dominions and Primitive Positive Functions.Miguel Campercholi - 2018 - Journal of Symbolic Logic 83 (1):40-54.

Analytics

Added to PP
2010-09-12

Downloads
31 (#736,320)

6 months
8 (#613,944)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Constraints, consistency and closure.Peter Jeavons, David Cohen & Martin C. Cooper - 1998 - Artificial Intelligence 101 (1-2):251-265.

Add more references