A juggler's dozen of easy\(^\dag\) problems (\(^\dag\) Well, easily formulated \dots).
From MaRDI portal
Publication:494618
DOI10.1007/s00012-015-0333-4zbMath1343.08003OpenAlexW586425522MaRDI QIDQ494618
Publication date: 1 September 2015
Published in: Algebra Universalis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00012-015-0333-4
congruence latticesfinite algebrasfinitely based varietiesdirectly indecomposable latticesfree lattices
Representation theory of lattices (06B15) Equational logic, Mal'tsev conditions (08B05) Subalgebras, congruence relations (08A30) Congruence modularity, congruence distributivity (08B10) Equational classes, universal algebra in model theory (03C05) Free lattices, projective lattices, word problems (06B25)
Related Items (5)
A MINIMAL CONGRUENCE LATTICE REPRESENTATION FOR ⋮ Dualizability of automatic algebras. ⋮ On representation of finite lattices ⋮ General algebra and its applications 2013: problem session. ⋮ Finite degree clones are undecidable
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the two kinds of probability in algebra
- Flat unars: the primal, the semi-primal and the dualisable
- A strong Mal'cev condition for locally finite varieties omitting the unary type
- Nonfinitely based pseudovarieties and inherently nonfinitely based varieties
- Basic questions for general algebras
- Results and problems on congruence lattice representations
- Equational theory of positive numbers with exponentiation is not finitely axiomatizable
- Existence theorems for weakly symmetric operations
- A property of the lattice of equational theories
- Finite equational bases for congruence modular varieties
- Every finite lattice can be embedded in a finite partition lattice
- On infinite subdirectly irreducible algebras in locally finite equational classes
- Polynomial interpolation and the Chinese remainder theorem for algebraic systems
- On pseudovarieties
- Intervals in the lattice of varieties
- Finite equational bases for finite algebras in a congruence-distributive equational class
- Para primal varieties: A study of finite axiomatizability and definable principal congruences in locally finite varieties
- Congruence lattices of finite algebras and intervals in subgroup lattices of finite groups
- A perspective on algebraic representations of lattices
- Natural dualities for quasivarieties generated by a finite commutative ring.
- Definable principal subcongruences.
- The Pontryagin duality of compact O-dimensional semilattices and its applications
- Near unanimity: An obstacle to general duality theory
- Congruences, equational theories and lattice representations
- Dualizability and graph algebras
- Dualities for quasi-varieties of bands.
- Expansions of finite algebras and their congruence lattices
- Dualizability of automatic algebras.
- Natural dualities for semilattice-based algebras
- Equational classes generated by finite algebras
- Dualisability. Unary algebras and beyond
- A finite basis theorem for difference-term varieties with a finite residual bound
- Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem
- UNREASONABLE LATTICES OF QUASIVARIETIES
- DUALISABILITY OF FINITE SEMIGROUPS
- COMPUTATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM FOR VARIETIES
- UNCOUNTABLY MANY DUALISABLE ALGEBRAS
- Nilpotent groups are not dualizable
- Nondualisable semigroups
- Some Application of Nevanlinna Theory to Mathematical Logic: Identities Exponential Functions
- EVERY SHIFT AUTOMORPHISM VARIETY HAS AN INFINITE SUBDIRECTLY IRREDUCIBLE MEMBER
- EQUATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM
- A Completeness Theorem for Trigonometric Identities and Various Results on Exponential Functions
- The Laws of Finite Pointed Groups
- Residually Small Varieties with Modular Congruence Lattices
- The lattice of equational theories. Part II: The lattice of full sets of terms
- The structure of finite algebras
- Ordered Topological Spaces and the Representation of Distributive Lattices
- Varieties Obeying Homotopy Laws
- Residually finite, congruence meet-semidistributive varieties of finite type have a finite residual bound
- Strong duality for metacyclic groups
- THE RESIDUAL BOUNDS OF FINITE ALGEBRAS
- THE RESIDUAL BOUND OF A FINITE ALGEBRA IS NOT COMPUTABLE
- TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE
- A finite basis theorem for residually finite, congruence meet-semidistributive varieties
- The shape of congruence lattices
- The unique factorization problem for finite relational structures
- The Theory of Representation for Boolean Algebras
- Identities in Finite Algebras
- Lattices, equivalence relations, and subgroups
- Full duality among graph algebras and flat graph algebras
- From rectangular bands to \(k\)-primal algebras
This page was built for publication: A juggler's dozen of easy\(^\dag\) problems (\(^\dag\) Well, easily formulated \dots).
