On some games which are relevant to the theory of recursively enumerable sets
From MaRDI portal
Publication:1393224
DOI10.2307/1970579zbMath0276.02023OpenAlexW2029823283MaRDI QIDQ1393224
Publication date: 1970
Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1970579
Related Items
Iterated trees and fragments of arithmetic ⋮ A game-theoretic equivalence to the Hahn-Banach theorem ⋮ A Decidable Fragment of the Elementary Theory of the Lattice of Recursively Enumerable Sets ⋮ Infinitary self-reference in learning theory ⋮ Diagonals and -maximal sets ⋮ Priority constructions ⋮ Formalism and intuition in computability ⋮ A General Framework for Priority Arguments ⋮ The complexity of recursion theoretic games ⋮ Short lists with short programs in short time ⋮ Gurevich-Harrington's games defined by finite automata ⋮ The nonlow computably enumerable degrees are not invariant in $\mathcal {E}$ ⋮ Codable sets and orbits of computably enumerable sets ⋮ \(r\)-maximal major subsets ⋮ AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES ⋮ Some lowness properties and computational complexity sequences ⋮ Recursively enumerable sets and degrees ⋮ Extension of Gurevich-Harrington's restricted memory determinacy theorem: A criterion for the winning player and an explicit class of winning strategies ⋮ Recursively enumerable complexity sequences and measure independence ⋮ Structural measures for games and process control in the branch learning model ⋮ Definable properties of the computably enumerable sets ⋮ Automorphisms of the lattice of recursively enumerable sets ⋮ On effectively computable realizations of choice functions
