On the public citation graph
Some undecidable determined games
0 signed · 39 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/malq.19810272504openalex-snapshot
Classification of Quantifier Prefixes Over Diophantine Equations
inferredcites →https://doi.org/10.1007/bf01448847openalex-snapshot
Zur Theorie der Gesellschaftsspiele
inferredcites →https://doi.org/10.1007/bf01700692openalex-snapshot
Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
inferredcites →https://doi.org/10.1007/s00605-006-0423-7openalex-snapshot
Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
inferredcites →https://doi.org/10.1016/s0049-237x(08)71882-2openalex-snapshot
Exponential Diophantine Representation of Recursively Enumerable Sets
inferredcites →https://doi.org/10.1016/s0049-237x(09)70352-0openalex-snapshot
On Recursive Unsolvability of Hilbert's Tenth Problem
inferredcites →https://doi.org/10.1017/s0022481200092744openalex-snapshot
Martin Davis, Hilary Putnam, and Julia Robinson. The decision problem for exponential diophantine equations. Annals of mathematics, second series vol. 74 (1961), pp. 425–436.
inferredcites →https://doi.org/10.1080/00029890.1974.11993652openalex-snapshot
Recursive Undecidability — An Exposition
inferredcites →https://doi.org/10.1090/s0002-9904-1944-08111-1openalex-snapshot
Recursively enumerable sets of positive integers and their decision problems
inferredcites →https://doi.org/10.1515/9781400882151-008openalex-snapshot
6. EFFECTIVE COMPUTABILITY OF WINNING STRATEGIES
inferredcites →https://doi.org/10.2307/1970289openalex-snapshot
The Decision Problem for Exponential Diophantine Equations
inferredcites →https://doi.org/10.2307/2272832openalex-snapshot
Three universal representations of recursively enumerable sets
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.
inferredcites →https://doi.org/10.4064/fm-49-2-129-141openalex-snapshot
An application of games to the completeness problem for formalized theories
inferredcites →https://doi.org/10.4064/fm-53-2-205-224openalex-snapshot
On the axiom of determinateness
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-0-387-68546-5_4openalex-snapshot
Computation Paradigms in Light of Hilbert's Tenth Problem
inferred← citeshttps://doi.org/10.1007/978-3-032-31176-4_6openalex-snapshot
Impartial Derivation Games on Context-Free Grammars
inferred← citeshttps://doi.org/10.1007/978-4-431-66862-6_38openalex-snapshot
Complexity and Economics of Institutions
inferred← citeshttps://doi.org/10.1007/978-94-015-8372-5_6openalex-snapshot
Computability, Complexity and Economics
inferred← citeshttps://doi.org/10.1007/bf01299326openalex-snapshot
Computability, complexity and economics
inferred← citeshttps://doi.org/10.1007/bf02112429openalex-snapshot
Computational complexity of winning strategies in two-person polynomial games
inferred← citeshttps://doi.org/10.1016/0097-3165(88)90030-1openalex-snapshot
Epidemiography II. Games with a dozing yet winning player
inferred← citeshttps://doi.org/10.1016/0304-4068(91)90001-aopenalex-snapshot
Computability and randomness of Nash equilibrium in infinite games
inferred← citeshttps://doi.org/10.1016/j.ijar.2023.109057openalex-snapshot
From undecidability of non-triviality and finiteness to undecidability of learnability
inferred← citeshttps://doi.org/10.1016/j.tcs.2002.11.001openalex-snapshot
Complexity, appeal and challenges of combinatorial games
inferred← citeshttps://doi.org/10.1017/9781009701839.004openalex-snapshot
Scenic Trails Ascending from Sea-Level Nim to Alpine Chess
inferred← citeshttps://doi.org/10.1017/9781316135167.033openalex-snapshot
Combinatorial Games: Selected Bibliography With A Succinct Gourmet Introduction
inferred← citeshttps://doi.org/10.1017/cbo9780511756306.015openalex-snapshot
Undecidable problems: a sampler
inferred← citeshttps://doi.org/10.1080/00029890.1998.12004988openalex-snapshot
Multivision: An Intractable Impartial Game With a Linear Winning Strategy
inferred← citeshttps://doi.org/10.1090/s0002-9947-05-04074-2openalex-snapshot
The complexity of recursion theoretic games
inferred← citeshttps://doi.org/10.1134/s0081543811080074openalex-snapshot
What can and cannot be done with Diophantine problems
inferred← citeshttps://doi.org/10.1216/rmj-1987-17-2-227openalex-snapshot
Topological games: On the 50th anniversary of the Banach Mazur game
inferred← citeshttps://doi.org/10.18778/7969-663-5.07openalex-snapshot
Generalized (topological) metric space. From nowhere density to infinite games
inferred← citeshttps://doi.org/10.2307/2589284openalex-snapshot
Multivision: An Intractable Impartial Game with a Linear Winning Strategy
inferred← citeshttps://doi.org/10.37236/1295openalex-snapshot
Efficient Covering Designs of the Complete Graph
inferred← citeshttps://doi.org/10.37236/1325openalex-snapshot
Combinatorial Game Theory Foundations Applied to Digraph Kernels
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.