Group Theoretic Properties of the Group of Computable Automorphisms of a Countable Dense Linear Order |
| |
Authors: | Lempp Steffen McCoy Charles Morozov Andrei Solomon Reed |
| |
Affiliation: | (1) Department of Mathematics, University of Wisconsin-Madison, Madison, WI, 53706, U.S.A.;(2) Sobolev Institute of Mathematics, Novosibirsk, Russia;(3) Department of Mathematics, University of Connecticut, Storrs, CT, 06269, U.S.A. |
| |
Abstract: | We compare Aut(Q), the classical automorphism group of a countable dense linear order, with Autc(Q), the group of all computable automorphisms of such an order. They have a number of similarities, including the facts that every element of each group is a commutator and each group has exactly three nontrivial normal subgroups. However, the standard proofs of these facts in Aut(Q) do not work for Autc(Q). Also, Aut(Q) has three fundamental properties which fail in Autc(Q): it is divisible, every element is a commutator of itself with some other element, and two elements are conjugate if and only if they have isomorphic orbital structures. |
| |
Keywords: | lattice-ordered groups automorphism groups computability theory effective algebra reverse mathematics |
本文献已被 SpringerLink 等数据库收录! |
|