DSpace Repository

Complexity of winning strategies for δ0 2 games

Show simple item record

dc.contributor.author Barua, Rana
dc.date.accessioned 2017-05-30T06:50:41Z
dc.date.available 2017-05-30T06:50:41Z
dc.date.issued 1993
dc.identifier.citation American Mathematical Society, vol.117, no.1, p.227-233 en_US
dc.identifier.uri http://hdl.handle.net/10263/6778
dc.language.iso en en_US
dc.subject Mathematical sets en_US
dc.subject Mathematical sequences en_US
dc.subject Mathematical theorems en_US
dc.subject Recursion en_US
dc.subject Integers en_US
dc.subject Natural numbers en_US
dc.title Complexity of winning strategies for δ0 2 games en_US
dc.type Article en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account