Show simple item record

dc.contributor.authorRackoff, Charlesen_US
dc.date.accessioned2023-03-29T14:03:47Z
dc.date.available2023-03-29T14:03:47Z
dc.date.issued1974-01
dc.identifier.urihttps://hdl.handle.net/1721.1/148871
dc.description.abstractLet N be the set of nonnegative integers and let < N ,+> be the weak direct product of < N,+> with itself. Mostowski[ 9 ] shows that the theory of < N ,*> is decidable, but his decision procedure isn't elementary recursive. We present here a more efficient procedure which operates within space 2 2 . As corollaries we obtain the same upper bound for the theory of finite abelian groups, the theory of finitely generated abelian groups, and the theory of the structure < N ,' > of positive ...en_US
dc.relation.ispartofseriesMIT-LCS-TM-042
dc.relation.ispartofseriesMAC-TM-042
dc.titleOn the Complexity of the Theories of Weak Direct Productsen_US
dc.identifier.oclc09610055


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record