Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Complexity of Winning Strategies for Δ 0 2 Games

From MaRDI portal
Publication:4032525
Jump to:navigation, search

DOI10.2307/2159721zbMath0769.03030OpenAlexW4243181102MaRDI QIDQ4032525

Rana Barua

Publication date: 1 April 1993

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2159721


zbMATH Keywords

winning strategyrecursion in higher typesdefinable games on omegatotal type 2-object


Mathematics Subject Classification ID

Descriptive set theory (03E15) Higher-type and set recursion theory (03D65)








This page was built for publication: Complexity of Winning Strategies for Δ 0 2 Games

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4032525&oldid=17747846"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 6 February 2024, at 02:45.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki