Sciweavers

NDJFL
2010
13 years 6 months ago
Decidability and Computability of Certain Torsion-Free Abelian Groups
We study completely decomposable torsion-free abelian groups of the form GS := nSQpn for sets S . We show that GS has a decidable copy if and only if S is 0 2 and has a computable...
Rodney G. Downey, Sergei S. Goncharov, Asher M. Ka...
JSYML
2010
78views more  JSYML 2010»
13 years 6 months ago
A characterization of the 0-basis homogeneous bounding degrees
We say a countable model A has a 0-basis if the types realized in A are uniformly computable. We say A has a (d-)decidable copy if there exists a model B = A such that the element...
Karen Lange
JSYML
2008
89views more  JSYML 2008»
13 years 10 months ago
The degree spectra of homogeneous models
Much previous study has been done on the degree spectra of prime models of a complete atomic decidable theory. Here we study the analogous questions for homogeneous models. We say...
Karen Lange