Decidability and Computability of Certain Torsion-Free Abelian Groups

12 years 11 months ago

Download www.math.uconn.edu

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 copy if and only if S is 0 3.

Rodney G. Downey, Sergei S. Goncharov, Asher M. Ka

Real-time Traffic

Computable Copy | Computer Networks | Decidable Copy | NDJFL 2010 | Torsion-free Abelian Groups |

claim paper

» Computable Ordered Abelian Groups and Fields

» Protocol Security and Algebraic Properties Decision Results for a Bounded Number of Sessio...

» Finitely Presented Abelian LatticeOrdered Groups

» New negative Latin square type partial difference sets in nonelementary abelian 2groups an...

» Distributed Source Coding using Abelian Group Codes

» Intruder Deductions Constraint Solving and Insecurity Decision in Presence of Exclusive or

» Intruder Deduction for ACLike Equational Theories with Homomorphisms

» On Fox Quotients of Arbitrary Group Algebras

Post Info
More Details (n/a)

Added	20 May 2011
Updated	20 May 2011
Type	Journal
Year	2010
Where	NDJFL
Authors	Rodney G. Downey, Sergei S. Goncharov, Asher M. Kach, Julia F. Knight, Oleg V. Kudinov, Alexander G. Melnikov, Daniel Turetsky

Comments (0)

Sciweavers

Decidability and Computability of Certain Torsion-Free Abelian Groups

Computable Copy | Computer Networks | Decidable Copy | NDJFL 2010 | Torsion-free Abelian Groups |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers