**6**

votes

**3**answers

878 views

### Does “finitely presented” mean “always finitely presented”, considered in general

I'm wondering about the question, "If we have a finitely presented __, is it necessarily finitely presented with respect to any finite generating set for it?" I know this is true for groups and for R-...

**7**

votes

**1**answer

534 views

### Does ⋄ generate all De Morgan algebras?

(Asked by Nathaniel Hellerstein on the Q&A board at JMM)
This question is about De Morgan algebras (see also Wikipedia), which are something like Boolean algebras, but with a different weaker ...

**6**

votes

**5**answers

540 views

### Binary operations compatible with the usual order on the reals

An officemate passes along the following natural-seeming question:
Say that a binary operation $\oplus$ is compatible with the usual order $\leq$ on $\mathbb{R}$ if for any $w, x, y, z$ in $\mathbb{R}...

**3**

votes

**2**answers

589 views

### Is the decomposition of an algebra into irreducible components essentially unique?

We consider finite algebras for a given signature, in the sense of universal algebra (for example, they might be groups, rings, or lattices). An algebra $A$ is irreducible when $A \cong B \times C$ ...

**1**

vote

**2**answers

992 views

### What is a semigroup or, what do I do with that associativity proof?

Mathematically, I know what a semigroup is: It is a set S along with an associative binary operation $* : S \times S \rightarrow S$. So far, so good.
From a computational perspective, one can ...

**7**

votes

**1**answer

737 views

### Lattice-ordered commutative monoids

By a lattice-ordered monoid, I mean a structure $(A,0,{+},{\vee},{\wedge})$ such that $(A,0,{+})$ is a (not necessarily commutative) monoid, $(A,{\vee},{\wedge})$ is a lattice, and the two ...

**3**

votes

**2**answers

242 views

### What do you call a lattice whose meet operation preserves disjointness of subsets?

To make my question more precise and compact (and probably more intuitive), let me define the following:
A subset $S$ of a lattice is mutually disjoint if for each $x \in S$, $\bigvee(S - \lbrace x \...

**10**

votes

**2**answers

822 views

### Free division rings?

Does it make sense to talk about, say, the free division ring on 2 generators? If so, does the free division ring on countably many generators embed into the free division ring on two generators?

**0**

votes

**1**answer

149 views

### How to define the action of $U(G)$ in this situation?

The usual action of $fg$ on $u⊗v$ , where $f,g$ are elements in the Universal Enveloping Algebra $U(G)$ of a Lie algebra $G$ and $u,v$ are elements of a representation $V$ of $G$, is given by $fg(u⊗v)...

**4**

votes

**2**answers

715 views

### Is there a notion of congruence relation for essentially algebraic structures?

In universal algebra there is the notion of congruence relation: Consider a (1-sorted) algebraic structure, i.e. a set $A$ with a bunch of finitary operations $f_i$ satisfying equations.
A congruence ...

**1**

vote

**4**answers

857 views

### Is monomorphism going in both directions sufficient for isomorphism?

In category theory, it seems that a monomorphism from $A$ to $B$ and one from $B$ to $A$ should be enough to guarantee isomorphy, but it doesn't seem to be so. (If I'm right then there's something ...

**9**

votes

**2**answers

652 views

### Right actions of operads and monads

Given an operad $A$, there is an associated monad $M_A$ given by $M_A(X) = \coprod_n A(n) \otimes X^{\otimes n}$ such that being an $A$-algebra and being an algebra over the monad $M_A$ is the same ...

**2**

votes

**1**answer

480 views

### Higher-order, multi-sorted, non purely equational version of universal algebra ?

I have been looking around, unsuccessfully, for generalizations of universal algebra based on higher-order logic (rather than first order) and where the relations are not purely equational. ...

**1**

vote

**1**answer

524 views

### Coequalizer in the category of primitive recursive functions

What does a coequalizer in the category of primitive recursive functions look like? I know that in Set, a coequalizer is a minimum congruence but...what is it in particular in the category of ...

**4**

votes

**2**answers

457 views

### Is every lattice the fixed-point set of an order endomorphism of ⋄^n?

(Asked by Nathaniel Hellerstein on the Q&A board at JMM)
Let ⋄ be the 4 element lattice
τ
/ \
i j
\ /
f
Is every lattice isomorphic to the fixed point lattice of some order-...