Some undecidable determined games
From MaRDI portal
Cites work
- An application of games to the completeness problem for formalized theories
- Classification of Quantifier Prefixes Over Diophantine Equations
- scientific article; zbMATH DE number 3128730 (Why is no real title available?)
- scientific article; zbMATH DE number 3131080 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3078993 (Why is no real title available?)
- scientific article; zbMATH DE number 3106184 (Why is no real title available?)
- On the axiom of determinateness
- Recursive Undecidability--An Exposition
- Recursively enumerable sets of positive integers and their decision problems
- The decision problem for exponential diophantine equations
- Three universal representations of recursively enumerable sets
- Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
Cited in
(10)- Epidemiography. II: Games with a dozing yet winning player
- Computability and randomness of Nash equilibrium in infinite games
- Computational complexity of winning strategies in two-person polynomial games
- Computability, complexity and economics
- Complexity, appeal and challenges of combinatorial games
- The complexity of recursion theoretic games
- From undecidability of non-triviality and finiteness to undecidability of learnability
- Modular Nim
- What can and cannot be done with Diophantine problems
- Impartial derivation games on context-free grammars
This page was built for publication: Some undecidable determined games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1171511)