Flat unars: the primal, the semi-primal and the dualisable
From MaRDI portal
Publication:607463
DOI10.1007/s00012-010-0080-5zbMath1207.08001MaRDI QIDQ607463
Brian A. Davey, Jane G. Pitkethly, D. L. Rifqui, David M. Clark
Publication date: 22 November 2010
Published in: Algebra Universalis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00012-010-0080-5
08A40: Operations and polynomials in algebraic structures, primal algebras
06A12: Semilattices
08C20: Natural dualities for classes of algebras
Related Items
Evolution of algebraic terms 3: Term continuity and beam algorithms, A juggler's dozen of easy\(^\dag\) problems (\(^\dag\) Well, easily formulated \dots)., Natural extensions and profinite completions of algebras, Bohr compactifications of algebras and structures, EVOLUTION OF ALGEBRAIC TERMS 1: TERM TO TERM OPERATION CONTINUITY
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dualisability versus residual character: a theorem and a counterexample
- Binary homomorphisms and natural dualities
- Natural dualities for quasivarieties generated by a finite commutative ring.
- The Pontryagin duality of compact O-dimensional semilattices and its applications
- Some remarks on dualisability and endodualisability
- Natural dualities for semilattice-based algebras
- Eine Charakterisierung funktional vollständiger Algebren
- On the topological duality for primal algebra theory
- Dualisability. Unary algebras and beyond
- Recursive inseparability for residual bounds of finite algebras
- Natural duality via a finite set of relations
- THE RESIDUAL BOUNDS OF FINITE ALGEBRAS
- THE RESIDUAL BOUND OF A FINITE ALGEBRA IS NOT COMPUTABLE
- TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE
- The Theory of Representation for Boolean Algebras
- The dualisability of a quasi-variety is independent of the generating algebra.
- Full duality among graph algebras and flat graph algebras
