id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
9z902z12x9k	Steven M. VanDenDriessche	Embedding Computable Infinitary Equivalence nto P-Groups	2013		.txt	text/plain	200	9	26	In an attempt to explore the boundary between computable infinitary Σα equivalenceand isomorphism, we show that for any computable , certain classes of countablereduced abelian p-groups are universal for ∼cα under Turing computable embedding. One may look at this program as eithera project in the computable structure theory of abelian p-groups, or as a projectin the construction of limits of sequences of uniform Turing computable operators.	cache/9z902z12x9k.txt	txt/9z902z12x9k.txt