-1
votes
1answer
149 views

Algebra generated by a tree [Edit] [closed]

Suppose that $(T,\leq)$ is a partially ordered set, we say $T$ is a tree* if for every $i\in T$, $\{s: s\in T, s\leq t\}$ is a well-founded chain. What I need to know is: Can the algebra ...
7
votes
0answers
219 views

Formally undecidable problems on finitely presented quandles

In the literature, one sometimes sees the claim that finitely presented quandles (in particular, knot quandles) are "hard to deal with". Hence, a great deal of effort has gone into studying finite ...
14
votes
1answer
749 views

Is Dependent Choice equivalent to the statement that every PID is factorial?

In this question, it was asked if AC is needed in the proof of the well-known fact that every principal ideal domain is factorial. As KConrad and Joel David Hamkins have pointed out, only DC, the ...
4
votes
1answer
330 views

Mechanically instantiating abstract constructions

I am looking for work on the effective inverse of abstraction, aka specialization. There are two ways in which abstraction helps us: Get a better understanding of the structural rules at play in ...
3
votes
2answers
758 views

computation, algebra, logic

So a really simple way of describing a digital computer is to say that it is a device for performing boolean operations. You feed it a bunch of bit strings, which is a description of the problem and ...