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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,122

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

Finite algebras of relations are representable on finite sets.H. Andréka, I. Hodkinson & I. Németi - 1999 - Journal of Symbolic Logic 64 (1):243-267.
A decidable variety that is finitely undecidable.Joohee Jeong - 1999 - Journal of Symbolic Logic 64 (2):651-677.
Decidable discriminator varieties from unary varieties.Stanley Burris, Ralph Mckenzie & Matthew Valeriote - 1991 - Journal of Symbolic Logic 56 (4):1355-1368.
Decidability and finite axiomatizability of theories of ℵ0-categorical partially ordered sets.James H. Schmerl - 1981 - Journal of Symbolic Logic 46 (1):101 - 120.
The lattice of modal logics: An algebraic investigation.W. J. Blok - 1980 - Journal of Symbolic Logic 45 (2):221-236.
On Endomorphisms of Ockham Algebras with Pseudocomplementation.T. S. Blyth & J. Fang - 2011 - Studia Logica 98 (1-2):237-250.
Finite basis problems and results for quasivarieties.Miklós Maróti & Ralph McKenzie - 2004 - Studia Logica 78 (1-2):293 - 320.
Decidability problem for finite Heyting algebras.Katarzyna Idziak & Pawel M. Idziak - 1988 - Journal of Symbolic Logic 53 (3):729-735.
The complexity of modellability in finite and computable signatures of a constraint logic for head-driven phrase structure grammar.Paul John King, Kiril Ivanov Simov & Bjørn Aldag - 1999 - Journal of Logic, Language and Information 8 (1):83-110.
Clifford Algebras in Symplectic Geometry and Quantum Mechanics.Ernst Binz, Maurice A. de Gosson & Basil J. Hiley - 2013 - Foundations of Physics 43 (4):424-439.

Analytics

Added to PP
2010-09-12

Downloads
19 (#717,158)

6 months
3 (#643,273)

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