Space complexity of Abelian groups

Archive for Mathematical Logic(2008)

引用 13|浏览9
暂无评分
摘要
We develop a theory of LOGSPACE structures and apply it to construct a number of examples of Abelian Groups which have LOGSPACE presentations. We show that all computable torsion Abelian groups have LOGSPACE presentations and we show that the groups ℤ, Z(p^∞) , and the additive group of the rationals have LOGSPACE presentations over a standard universe such as the tally representation and the binary representation of the natural numbers. We also study the effective categoricity of such groups. For example, we give conditions are given under which two isomorphic LOGSPACE structures will have a linear space isomorphism.
更多
查看译文
关键词
Computability,Complexity theory,Computable model theory
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要