On the public citation graph

A splitting theorem for the Medvedev and Muchnik lattices

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.1016/0003-4843(76)90016-4openalex-snapshot
A recursively enumerable degree which will not split over all lesser ones
inferredcites →https://doi.org/10.2140/pjm.1972.40.605openalex-snapshot
Degrees of members of Π10classes

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-3-319-20028-6_9openalex-snapshot
Degrees of Unsolvability: A Tutorial
inferred← citeshttps://doi.org/10.1007/978-3-642-03073-4_12openalex-snapshot
Immunity for Closed Sets
inferred← citeshttps://doi.org/10.1007/s00153-003-0195-xopenalex-snapshot
Embeddings into the Medvedev and Muchnik lattices of ? 0 1 classes
inferred← citeshttps://doi.org/10.1007/s00153-005-0278-yopenalex-snapshot
The Medvedev lattice of computably closed sets
inferred← citeshttps://doi.org/10.1007/s00153-005-0319-6openalex-snapshot
Small Π0 1 Classes
inferred← citeshttps://doi.org/10.1007/s00153-007-0058-yopenalex-snapshot
Degrees of difficulty of generalized r.e. separating classes
inferred← citeshttps://doi.org/10.1007/s00153-007-0062-2openalex-snapshot
Embedding FD(ω) into $${\mathcal{P}_s}$$ densely
inferred← citeshttps://doi.org/10.1007/s00153-009-0150-6openalex-snapshot
The ∀∃-theory of the effectively closed Medvedev degrees is decidable
inferred← citeshttps://doi.org/10.1016/j.apal.2008.03.002openalex-snapshot
Intermediate logics and factors of the Medvedev lattice
inferred← citeshttps://doi.org/10.1016/j.apal.2011.10.002openalex-snapshot
Coding true arithmetic in the Medvedev degrees of Π10 classes
inferred← citeshttps://doi.org/10.1016/j.apal.2014.01.003openalex-snapshot
Inside the Muchnik degrees I: Discontinuity, learnability and constructivism
inferred← citeshttps://doi.org/10.1016/j.apal.2014.03.001openalex-snapshot
Inside the Muchnik degrees II: The degree structures induced by the arithmetical hierarchy of countably continuous functions
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.08.014openalex-snapshot
Medvedev Degrees of Generalized R.E. separating Classes
inferred← citeshttps://doi.org/10.1017/etds.2012.152openalex-snapshot
Medvedev degrees of two-dimensional subshifts of finite type
inferred← citeshttps://doi.org/10.1017/s0960129513000303openalex-snapshot
Comparing the Medvedev and Turing degrees of Π01 classes
inferred← citeshttps://doi.org/10.1090/memo/1135openalex-snapshot
Classes of Polish spaces under effective Borel isomorphism
inferred← citeshttps://doi.org/10.1093/logcom/exn021openalex-snapshot
K-Triviality of Closed Sets and Continuous Functions
inferred← citeshttps://doi.org/10.1112/jlms/jdl015openalex-snapshot
An extension of the recursively enumerable Turing degrees
inferred← citeshttps://doi.org/10.1142/9789812796554_0017openalex-snapshot
SOME FUNDAMENTAL ISSUES CONCERNING DEGREES OF UNSOLVABILITY
inferred← citeshttps://doi.org/10.1142/s0219061307000652openalex-snapshot
MASS PROBLEMS AND HYPERARITHMETICITY
inferred← citeshttps://doi.org/10.1142/s0219061316500069openalex-snapshot
Mass problems and density
inferred← citeshttps://doi.org/10.1215/00294527-2008-002openalex-snapshot
Mass Problems and Intuitionism
inferred← citeshttps://doi.org/10.1215/00294527-2008-009openalex-snapshot
Classifying the Branching Degrees in the Medvedev Lattice of Π 1 0 Classes
inferred← citeshttps://doi.org/10.2178/bsl/1107959497openalex-snapshot
Mass Problems and Randomness
inferred← citeshttps://doi.org/10.2178/bsl/1255526079openalex-snapshot
Mass Problems and Measure-Theoretic Regularity
inferred← citeshttps://doi.org/10.2178/bsl/1333560805openalex-snapshot
A Survey of Mučnik and Medvedev Degrees
inferred← citeshttps://doi.org/10.2178/jsl/1174668385openalex-snapshot
Non-branching degrees in the Medvedev lattice of Π10 classes
inferred← citeshttps://doi.org/10.2178/jsl/1231082316openalex-snapshot
Finding paths through narrow and wide trees
inferred← citeshttps://doi.org/10.2748/tmj/1325886278openalex-snapshot
Mass problems associated with effectively closed sets
inferred← citeshttps://doi.org/10.32513/tbilisi/1528768843openalex-snapshot
Immunity and Non-Cupping for Closed Sets
inferred← citeshttps://doi.org/10.48550/arxiv.1007.2376openalex-snapshot
A Survey of Muchnik and Medvedev degrees
inferred← citeshttps://doi.org/10.48550/arxiv.1701.03735openalex-snapshot
Classes of Polish spaces under effective Borel isomorphism
inferred← citeshttps://doi.org/10.48550/arxiv.2204.11289openalex-snapshot
Complexity and Avoidance
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.