Topology Atlas | Conferences

Knots in Washington XXXV
December 7-9, 2012
George Washington University
Washington, DC, USA

Organizers
Mieczyslaw K. Dabkowski (UT Dallas), Valentina Harizanov (GWU), Jozef H. Przytycki (GWU), Yongwu Rong (GWU), Radmila Sazdanovic (U.Penn), Alexander Shumakovitch (GWU), Hao Wu (GWU)

Conference Homepage


Non-associative structures and their computability theoretic complexity
by
Kai Maeda
George Washington University

Richter’s degree of a countable algebraic structure is a Turing degree theoretic measure of the complexity of its isomorphism class. It has been shown that some structures, such as abelian groups or partially ordered sets, have arbitrary Richter’s degrees, by showing that their isomorphism classes contain infinite anti-chains of structures with certain algebraic and computability theoretic properties. I will extend these results to non-associative structures such as quandles.

Date received: November 26, 2012

Copyright © 2012 by the author(s). The author(s) of this work and the organizers of the conference have granted their consent to include this abstract in Topology Atlas. Document # cbfw-39.