On the public citation graph
Linear orderings under one-one reducibility
0 signed · 47 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.1007/bf01342904openalex-snapshot
Recursive digraphs, splinters and cylinders
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.1090/s0002-9939-1963-0155757-1openalex-snapshot
A Note on Bounded-Truth-Table Reducibility
inferredcites →https://doi.org/10.1090/s0002-9939-1964-0179079-9openalex-snapshot
On Reducibility by Recursive Functions
inferredcites →https://doi.org/10.1090/s0002-9947-1965-0209151-1openalex-snapshot
On Semi-Cylinders, Splinters, and Bounded-Truth-Table Reducibility
inferredcites →https://doi.org/10.2140/pjm.1963.13.693openalex-snapshot
Approximations of functions on the integers
inferredcites →https://doi.org/10.2140/pjm.1964.14.749openalex-snapshot
A note on pseudo-creative sets and cylinders
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/malq.19670130106openalex-snapshot
On Pseudo‐Creative Sets, Splinters, and Bounded‐Truth‐Table Reducibility
inferred← citeshttps://doi.org/10.1002/malq.19780241303openalex-snapshot
On the Simplicity of Busy Beaver Sets
inferred← citeshttps://doi.org/10.1002/malq.19840300703openalex-snapshot
SYSTEM FUNCTIONS AND THEIR DECISION PROBLEMS
inferred← citeshttps://doi.org/10.1002/malq.19950410311openalex-snapshot
Some New Lattice Constructions in High R. E. Degrees
inferred← citeshttps://doi.org/10.1007/3-540-51486-4_73openalex-snapshot
Polynomial-time functions generate SAT: On P-splinters
inferred← citeshttps://doi.org/10.1007/978-1-4612-4478-3_4openalex-snapshot
Juris Hartmanis: Fundamental Contributions to Isomorphism Problems
inferred← citeshttps://doi.org/10.1007/978-1-4612-4478-3_7openalex-snapshot
The Structure of Complete Degrees
inferred← citeshttps://doi.org/10.1007/978-3-540-78488-3_21openalex-snapshot
On the Complexity of the Privacy Problem in Databases
inferred← citeshttps://doi.org/10.1007/bf01876317openalex-snapshot
Partially ordered sets of 1-degrees, contained in recursively enumerable m-degrees
inferred← citeshttps://doi.org/10.1007/bf02276798openalex-snapshot
Diem-Grade Logischer Entscheidungsprobleme
inferred← citeshttps://doi.org/10.1007/s10469-017-9439-4openalex-snapshot
Irreducible, Singular, and Contiguous Degrees
inferred← citeshttps://doi.org/10.1007/s10958-021-05426-yopenalex-snapshot
Computable Presentability of Countable Linear Orders
inferred← citeshttps://doi.org/10.1016/0022-0000(81)90013-1openalex-snapshot
Independence results in computer science?
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90139-2openalex-snapshot
Reductions among polynomial isomorphism types
inferred← citeshttps://doi.org/10.1016/s0022-0000(72)80005-9openalex-snapshot
Combinatorial systems I. Cylindrical problems
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70194-6openalex-snapshot
Small Degrees in Ordinary Recursion Theory
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.1070/rm1979v034n03abeh003988openalex-snapshot
REDUCIBILITIES OF TABULAR TYPE IN THE THEORY OF ALGORITHMS
inferred← citeshttps://doi.org/10.1090/s0002-9947-1967-0215714-1openalex-snapshot
Two Theorems on Hyperhypersimple Sets
inferred← citeshttps://doi.org/10.1090/s0002-9947-1969-0245439-xopenalex-snapshot
Relationships Between Reducibilities
inferred← citeshttps://doi.org/10.1090/s0002-9947-1972-0363839-4openalex-snapshot
Almost Recursively Enumerable Sets
inferred← citeshttps://doi.org/10.1090/s0273-0979-1981-14863-1openalex-snapshot
Strong reducibilities
inferred← citeshttps://doi.org/10.1093/jigpal/jzae005openalex-snapshot
Non-empty open intervals of computably enumerable sQ1-degrees
inferred← citeshttps://doi.org/10.1093/logcom/exab026openalex-snapshot
Notes on conjunctive and Quasi degrees
inferred← citeshttps://doi.org/10.1093/logcom/exad064openalex-snapshot
Conjunctive degrees and cylinders
inferred← citeshttps://doi.org/10.1134/s1995080221120076openalex-snapshot
On 1-Degrees Inside $$\boldsymbol{m}$$-Degrees
inferred← citeshttps://doi.org/10.1145/800061.808770openalex-snapshot
Some structural properties of polynomial reducibilities and sets in NP
inferred← citeshttps://doi.org/10.1145/800141.804653openalex-snapshot
Independence results in Computer Science? (Preliminary Version)
inferred← citeshttps://doi.org/10.1305/ndjfl/1093870309openalex-snapshot
Cylindrical decision problems for system functions.
inferred← citeshttps://doi.org/10.1305/ndjfl/1093887936openalex-snapshot
The one-one equivalence of some general combinatorial decision problems.
inferred← citeshttps://doi.org/10.2140/pjm.1969.29.351openalex-snapshot
Initial segments of one-one degrees
inferred← citeshttps://doi.org/10.2140/pjm.1972.41.485openalex-snapshot
Supersimple sets and the problem of extending a retracing function
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.