Bard Mathematics, Computer Science, and Physics Talks

The speaker presents a meta term rewriting system (TRS) for the laws of idempotence, right-cancellation, and right self-distributivity. Particular instances of this meta TRS demonstrate that the equational theories of quandles, involutory quandles, racks, and right symmmetric, right distributive groupoids (RSRD) are decidable. Moreover, another instance encodes the standard solution to the three-peg Tower of Hanoi problem. This is joint work with Peter Golbus of Northeastern University and Claudio Gutierrez of the University of Chile in Santiago.

This talk will be accessible to those familiar with elementary formal mathematics.

	Quandles and Decidability Robert W. McGrail ASC Laboratory Bard College Thursday, September 24, 2009 4:15 PM RKC 111
The speaker presents a meta term rewriting system (TRS) for the laws of idempotence, right-cancellation, and right self-distributivity. Particular instances of this meta TRS demonstrate that the equational theories of quandles, involutory quandles, racks, and right symmmetric, right distributive groupoids (RSRD) are decidable. Moreover, another instance encodes the standard solution to the three-peg Tower of Hanoi problem. This is joint work with Peter Golbus of Northeastern University and Claudio Gutierrez of the University of Chile in Santiago. This talk will be accessible to those familiar with elementary formal mathematics.

Bard College Mathematics, Computer Science, and Physics Talks