September 2009 The existence of a near-unanimity term in a finite algebra is decidable
Miklós Maróti
J. Symbolic Logic 74(3): 1001-1014 (September 2009). DOI: 10.2178/jsl/1245158096

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.

Citation

Download Citation

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

Information

Published: September 2009
First available in Project Euclid: 16 June 2009

zbMATH: 1174.08002
MathSciNet: MR2548473
Digital Object Identifier: 10.2178/jsl/1245158096

Rights: Copyright © 2009 Association for Symbolic Logic

JOURNAL ARTICLE
14 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

Vol.74 • No. 3 • September 2009
Back to Top