On the public citation graph

Priority arguments using iterated trees of strategies

https://doi.org/10.1007/bfb0086123
0 signed · 36 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-662-02460-7openalex-snapshot
Recursively Enumerable Sets and Degrees
inferredcites →https://doi.org/10.1007/bfb0016275openalex-snapshot
An alternative, priority-free, solution to Post's problem
inferredcites →https://doi.org/10.1007/bfb0066770openalex-snapshot
Cambridge Summer School in Mathematical Logic
inferredcites →https://doi.org/10.1007/bfb0066779openalex-snapshot
The priority method for the construction of recursively enumerable sets
inferredcites →https://doi.org/10.1007/bfb0066780openalex-snapshot
Admissible ordinals and priority arguments
inferredcites →https://doi.org/10.1016/0168-0072(86)90048-5openalex-snapshot
Stability of recursive structures in arithmetical degrees
inferredcites →https://doi.org/10.1016/0168-0072(88)90034-6openalex-snapshot
A non-inversion theorem for the jump operator
inferredcites →https://doi.org/10.1016/s0049-237x(08)70130-7openalex-snapshot
On the use of Diagonally Nonrecursive Functions
inferredcites →https://doi.org/10.1017/s0022481200051598openalex-snapshot
The infinite injury priority method
inferredcites →https://doi.org/10.1073/pnas.43.2.236openalex-snapshot
TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
inferredcites →https://doi.org/10.1090/s0002-9904-1978-14552-2openalex-snapshot
Recursively enumerable sets and degrees
inferredcites →https://doi.org/10.1090/s0002-9947-1963-0155747-3openalex-snapshot
Recursive enumerability and the jump operator
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.2307/1970214openalex-snapshot
On the Degrees Less than 0 �
inferredcites →https://doi.org/10.2307/1970393openalex-snapshot
The Recursively Enumerable Degrees are Dense
inferredcites →https://doi.org/10.2307/1970579openalex-snapshot
On Some Games Which Are Relevant to the Theory of Recursively Enumerable Sets
inferredcites →https://doi.org/10.2307/2272252openalex-snapshot
The infinite injury priority method

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-1-4612-0325-4_15openalex-snapshot
The Combinatorics of the Friedberg-Muchnick Theorem
inferred← citeshttps://doi.org/10.1007/978-1-4612-0325-4_17openalex-snapshot
Minimal Pair Constructions and Iterated Trees of Strategies
inferred← citeshttps://doi.org/10.1007/bf01270390openalex-snapshot
Iterated trees and fragments of arithmetic
inferred← citeshttps://doi.org/10.1007/s001530050067openalex-snapshot
Iterated trees of strategies and priority arguments
inferred← citeshttps://doi.org/10.1016/0168-0072(93)90207-topenalex-snapshot
Incomparable prime ideals of recursively enumerable degrees
inferred← citeshttps://doi.org/10.1016/0168-0072(95)00054-2openalex-snapshot
Σ5-completeness of index sets arising from the recursively enumerable Turing degrees
inferred← citeshttps://doi.org/10.1016/0168-0072(95)00055-0openalex-snapshot
∑5-completeness of index sets arising from the lattice of recursively enumerable sets
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50010-1openalex-snapshot
Degrees of Unsolvability
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80012-8openalex-snapshot
Chapter 11 A bibliography of recursive algebra and recursive model theory
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80047-5openalex-snapshot
Chapter 14 Computability theory and linear orderings
inferred← citeshttps://doi.org/10.1016/s0168-0072(97)00055-9openalex-snapshot
∑2-constructions and I∑1
inferred← citeshttps://doi.org/10.1016/s0168-0072(97)00070-5openalex-snapshot
Coding a family of sets
inferred← citeshttps://doi.org/10.1017/cbo9780511750779openalex-snapshot
A Framework for Priority Arguments
inferred← citeshttps://doi.org/10.1017/jsl.2014.11openalex-snapshot
PRIORITY ARGUMENTS VIA TRUE STAGES
inferred← citeshttps://doi.org/10.1071/hr9981210083openalex-snapshot
Cristopher John Ash 1945-1995
inferred← citeshttps://doi.org/10.2307/2275452openalex-snapshot
The existential theory of the poset of R.E. degrees with a predicate for single jump reducibility
inferred← citeshttps://doi.org/10.2307/2275519openalex-snapshot
Requirement systems
inferred← citeshttps://doi.org/10.2307/2275739openalex-snapshot
The combinatorics of the splitting theorem
inferred← citeshttps://doi.org/10.48550/arxiv.1306.2623openalex-snapshot
Priority arguments via true strages
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.