Speaker: Rumen Dimitrov, Western Illinois University

http://www.wiu.edu/users/rdd104/home.htm

Title: Complexity of GSL
Abstract: Let L be the lattice of computably enumerable subspaces of the fully computable infinite-dimensional vector space V. Guichard proved that the automorphisms of L are generated by computable semilinear transformations. Assume that V is a vector space over a computable rigid field, and let GSL be the group of 1–1, onto, computable linear transformations. In this talk we will prove results related to complexity of GSL.