Computability theory and automorphisms of lattices of substructures

Abstract: We use computability-theoretic concepts and methods to study automorphisms of lattices of substructures of a canonical computable infinite-dimensional vector space over the rationals. In particular, we establish the equivalence of the embedding relation for certain automorphism groups with the order relation of the corresponding Turing degrees. We further determine the Turing degrees of these automorphism groups. We establish similar results for the interval Boolean algebra over the rationals. This is joint work with Rumen Dimitrov and Andrei Morozov.

group theorylogic

Audience: researchers in the topic

Online logic seminar

Series comments: Description: Seminar on all areas of logic