Recursively presented games and strategies
type: Item
instance of: scholarly article
title: Recursively presented games and strategies
zbMATH Open document ID: 0786.90103
DOI: 10.1016/0165-4896(92)90059-E
author: Douglas Cenzer
author: Jeffrey Remmel
published in: Mathematical Social Sciences
publication date: 1992-12-16T00:00:00Z
Mathematics Subject Classification ID: 91A20
zbMATH DE Number: 77888
zbMATH Keywords: Gale-Stewart game
zbMATH Keywords: infinite game
zbMATH Keywords: complexity of the set of winning strategies
zbMATH Keywords: polynomial time presented game
zbMATH Keywords: polynomial time winning strategy
MaRDI profile type: Publication
cites work: Polynomial-time versus recursive models
cites work: Polynomial-time Abelian groups
cites work: Q5817866
cites work: ∏ 0 1 Classes and Degrees of Theories
cites work: Degrees of members of \(\Pi_ 1^ 0\) classes
cites work: Q5592246
cites work: Q4723720
cites work: Effective Matchmaking (Recursion Theoretic Aspects of a Theorem of Philip Hall)
cites work: Effective content of field theory
cites work: Q5322161
cites work: Graph colorings and recursively bounded \(\Pi ^ 0_ 1\)-classes
cites work: Q5573961
cites work: Theory of games and economic behavior.
description: scientific article; zbMATH DE number 77888