Journal of Symbolic Logic

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

Miklós Maróti

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

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.

Article information

Source
J. Symbolic Logic, Volume 74, Issue 3 (2009), 1001-1014.

Dates
First available in Project Euclid: 16 June 2009

Permanent link to this document
https://projecteuclid.org/euclid.jsl/1245158096

Digital Object Identifier
doi:10.2178/jsl/1245158096

Mathematical Reviews number (MathSciNet)
MR2548473

Zentralblatt MATH identifier
1174.08002

Citation

Maróti, Miklós. The existence of a near-unanimity term in a finite algebra is decidable. J. Symbolic Logic 74 (2009), no. 3, 1001--1014. doi:10.2178/jsl/1245158096. https://projecteuclid.org/euclid.jsl/1245158096


Export citation