Decidability and finite axiomatisability of finitary discrete 2-theories

Jon Cohen (04/06/08)

A finitely presented finitary discrete 2-theory holds some hope of being computationally tractable. With regards to the free algebra that such a structure generates, I'll ask (and answer):

• Is there a decision procedure for the commutativity of diagrams? (Yes with an "if")
• Can we always find a finite set of diagrams whose commutativity imply the commutativity of all others? (No with a "but")

Other talks by the same speaker.
Back to titles of seminars.

---

Steve Lack

Last modified: Fri Jun 6 12:36:25 EST 2008