On the public citation graph
Cototal enumeration degrees and their applications to effective mathematics
0 signed · 40 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.19710170139openalex-snapshot
Arithmetical Reducibilities I
inferredcites →https://doi.org/10.1007/978-3-642-13962-8_10openalex-snapshot
Computability of Countable Subshifts
inferredcites →https://doi.org/10.1007/s00224-011-9358-zopenalex-snapshot
Computability of Countable Subshifts in One Dimension
inferredcites →https://doi.org/10.1016/j.apal.2018.01.001openalex-snapshot
Density of the cototal enumeration degrees
inferredcites →https://doi.org/10.1016/j.tcs.2012.08.027openalex-snapshot
Turing degrees of multidimensional SFTs
inferredcites →https://doi.org/10.1016/s0049-237x(08)71350-8openalex-snapshot
Algebraisch Abgeschlossene Gruppen
inferredcites →https://doi.org/10.1016/s1385-7258(55)50032-1openalex-snapshot
Certain simple unsolvable problems of group theory. III
inferredcites →https://doi.org/10.1017/etds.2012.152openalex-snapshot
Medvedev degrees of two-dimensional subshifts of finite type
inferredcites →https://doi.org/10.1017/fms.2022.7openalex-snapshot
Point Degree Spectra of Represented Spaces
inferredcites →https://doi.org/10.2178/jsl/1082418543openalex-snapshot
Degrees of unsolvability of continuous functions
inferredcites →https://doi.org/10.2307/2272737openalex-snapshot
Omitting quantifier-free types in generic structures
inferredcites →https://doi.org/10.48550/arxiv.cs/0404021openalex-snapshot
Decidability and Universality in Symbolic Dynamical Systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
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/j.apal.2018.01.001openalex-snapshot
Density of the cototal enumeration degrees
inferred← citeshttps://doi.org/10.1017/9781108525749.004openalex-snapshot
Existentially-Atomic Models
inferred← citeshttps://doi.org/10.1017/9781108525749.007openalex-snapshot
Comparing Structures and Classes of Structures
inferred← citeshttps://doi.org/10.1017/9781108525749.008openalex-snapshot
Finite-Injury Constructions
inferred← citeshttps://doi.org/10.1017/jsl.2019.72openalex-snapshot
A STRUCTURAL DICHOTOMY IN THE ENUMERATION DEGREES
inferred← citeshttps://doi.org/10.1017/jsl.2022.55openalex-snapshot
PA RELATIVE TO AN ENUMERATION ORACLE
inferred← citeshttps://doi.org/10.1017/jsl.2023.95openalex-snapshot
INTROENUMERABILITY, AUTOREDUCIBILITY, AND RANDOMNESS
inferred← citeshttps://doi.org/10.1090/tran/7604openalex-snapshot
On cototality and the skip operator in the enumeration degrees
inferred← citeshttps://doi.org/10.3934/dcds.2020334openalex-snapshot
The relationship between word complexity and computational complexity in subshifts
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.