Flat unars: the primal, the semi-primal and the dualisable
From MaRDI portal
Publication:607463
DOI10.1007/S00012-010-0080-5zbMATH Open1207.08001OpenAlexW2132832359MaRDI QIDQ607463FDOQ607463
Brian A. Davey, Jane G. Pitkethly, David M. Clark, D. L. Rifqui
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
Recommendations
Semilattices (06A12) Operations and polynomials in algebraic structures, primal algebras (08A40) Natural dualities for classes of algebras (08C20)
Cites Work
- The Theory of Representation for Boolean Algebras
- Natural dualities for quasivarieties generated by a finite commutative ring.
- The Pontryagin duality of compact O-dimensional semilattices and its applications
- Natural dualities for semilattice-based algebras
- Title not available (Why is that?)
- Natural duality via a finite set of relations
- Title not available (Why is that?)
- TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE
- Dualisability. Unary algebras and beyond
- Title not available (Why is that?)
- Some remarks on dualisability and endodualisability
- The dualisability of a quasi-variety is independent of the generating algebra.
- Title not available (Why is that?)
- THE RESIDUAL BOUNDS OF FINITE ALGEBRAS
- THE RESIDUAL BOUND OF A FINITE ALGEBRA IS NOT COMPUTABLE
- Title not available (Why is that?)
- Full duality among graph algebras and flat graph algebras
- Dualisability versus residual character: a theorem and a counterexample
- Binary homomorphisms and natural dualities
- Eine Charakterisierung funktional vollständiger Algebren
- On the topological duality for primal algebra theory
- Recursive inseparability for residual bounds of finite algebras
- Title not available (Why is that?)
Cited In (6)
- Evolution of algebraic terms 3: Term continuity and beam algorithms
- Evolution of algebraic terms. I: Term to term operation continuity
- Natural extensions and profinite completions of algebras
- A juggler's dozen of easy\(^\dag\) problems (\(^\dag\) Well, easily formulated \dots).
- Bohr compactifications of algebras and structures
- Dualisability of partial unars
Uses Software
This page was built for publication: Flat unars: the primal, the semi-primal and the dualisable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q607463)