Abstract:
We prove that there is a first-order sentence $\varphi$ such that the group of all computable automorphisms of the ordering of the rational numbers is its only model among the groups that are embeddable in the group of all computable permutations.
Keywords:group of all computable automorphisms of rational numbers, finitely axiomatizable theory, categorical theory.