Computable Ordered Abelian Groups and Fields [chapter]

Alexander G. Melnikov
2010 Lecture Notes in Computer Science  
We present transformations of linearly ordered sets into ordered abelian groups and ordered fields. We study effective properties of the transformations. In particular, we show that a linear order L has a ∆ 0 2 copy if and only if the corresponding ordered group (ordered field) has a computable copy. We apply these codings to study the effective categoricity of linear ordered groups and fields.
doi:10.1007/978-3-642-13962-8_36 fatcat:g4l3m5slonhthpcw7chpviqegy