On the public citation graph
On some filters and ideals of the Medvedev lattice
0 signed · 23 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.19910370905openalex-snapshot
Some Quotient Lattices of the Medvedev Lattice
inferredcites →https://doi.org/10.1007/bf02761906openalex-snapshot
Automorphism bases for degrees of unsolvability
inferredcites →https://doi.org/10.1016/0003-4843(71)90003-9openalex-snapshot
Enumeration reducibility and partial degrees
inferredcites →https://doi.org/10.1017/s0022481200051343openalex-snapshot
Countable initial segments of the degrees of unsolvability
inferredcites →https://doi.org/10.1017/s0305004100052221openalex-snapshot
Banach–Mazur games, comeager sets and degrees of unsolvability
inferredcites →https://doi.org/10.1305/ndjfl/1093635751openalex-snapshot
Embedding Brouwer algebras in the Medvedev lattice.
inferredcites →https://doi.org/10.2307/2273104openalex-snapshot
Partial degrees and the density problem
inferredcites →https://doi.org/10.2307/2274668openalex-snapshot
Some remarks on the algebraic structure of the Medvedev Lattice
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.
inferredcites →https://doi.org/10.2307/2964426openalex-snapshot
Daniel Lacombe. Sur le semi-réseau constitué par les degrés d'indécidabilité récursive. Comptes rendus hebdomadaires des séances de l'Académie des Sciences (Paris), vol. 239 (1954), pp. 1108–1109.
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.19910370905openalex-snapshot
Some Quotient Lattices of the Medvedev Lattice
inferred← citeshttps://doi.org/10.1002/malq.19960420111openalex-snapshot
A Note on Closed Degrees of Difficulty of the Medvedev Lattice
inferred← citeshttps://doi.org/10.1007/978-1-4615-0755-0_15openalex-snapshot
Local Properties of the Non-Total Enumeration Degrees
inferred← citeshttps://doi.org/10.1007/bf01759368openalex-snapshot
Quasi-minimal enumeration degrees and minimal Turing degrees
inferred← citeshttps://doi.org/10.1007/bfb0086114openalex-snapshot
Enumeration reducibility, nondeterministic computations and relative computability of partial functions
inferred← citeshttps://doi.org/10.1007/s00153-010-0215-6openalex-snapshot
Topological aspects of the Medvedev lattice
inferred← citeshttps://doi.org/10.1007/s00153-018-0648-xopenalex-snapshot
Comparing the degrees of enumerability and the closed Medvedev degrees
inferred← citeshttps://doi.org/10.1016/s0168-0072(97)00076-6openalex-snapshot
Sets of generators and automorphism bases for the enumeration degrees
inferred← citeshttps://doi.org/10.1017/cbo9780511629167.015openalex-snapshot
The Medvedev lattice of degrees of difficulty
inferred← citeshttps://doi.org/10.1215/00294527-2010-034openalex-snapshot
Characterizing the Join-Irreducible Medvedev Degrees
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.