On the public citation graph

Lattice embeddings below a nonlow2 recursively enumerable degree

https://doi.org/10.1007/bf02762706
0 signed · 49 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.1002/malq.19710170131openalex-snapshot
Sublattices of the Recursively Enumerable Degrees
inferredcites →https://doi.org/10.1002/malq.19890350102openalex-snapshot
Embedding Lattices with Top Preserved Below Non‐GL2 Degrees
inferredcites →https://doi.org/10.1002/malq.19930390151openalex-snapshot
Highness and bounding minimal pairs
inferredcites →https://doi.org/10.1007/978-1-4612-0325-4_2openalex-snapshot
Embedding Distributive Lattices Preserving 1 below a Nonzero Recursively Enumerable Turing Degree
inferredcites →https://doi.org/10.1007/978-3-662-02460-7openalex-snapshot
Recursively Enumerable Sets and Degrees
inferredcites →https://doi.org/10.1007/bf01621095openalex-snapshot
Working below a low2 recursively enumerably degree
inferredcites →https://doi.org/10.1007/bfb0059544openalex-snapshot
Embedding nondistributive lattices in the recursively enumerable degrees
inferredcites →https://doi.org/10.1007/bfb0066780openalex-snapshot
Admissible ordinals and priority arguments
inferredcites →https://doi.org/10.1007/bfb0086116openalex-snapshot
Array nonrecursive sets and multiple permitting arguments
inferredcites →https://doi.org/10.1016/0001-8708(80)90027-4openalex-snapshot
Not every finite lattice is embeddable in the recursively enumerable degrees
inferredcites →https://doi.org/10.1016/0003-4843(75)90007-8openalex-snapshot
The weak truth table degrees of recursively enumerable sets
inferredcites →https://doi.org/10.1016/0168-0072(86)90071-0openalex-snapshot
Structural interactions of the recursively enumerable T- and W-degrees
inferredcites →https://doi.org/10.1016/0168-0072(89)90011-0openalex-snapshot
Completely mitotic R.E. degrees
inferredcites →https://doi.org/10.1016/0168-0072(90)90062-7openalex-snapshot
Lattice nonembeddings and initial segments of the recursively enumerable degrees
inferredcites →https://doi.org/10.1016/0168-0072(91)90044-mopenalex-snapshot
The density of infima in the recursively enumerable degrees
inferredcites →https://doi.org/10.1016/0168-0072(93)90220-8openalex-snapshot
Lattice nonembeddings and intervals of the recursively enumerable degrees
inferredcites →https://doi.org/10.1016/0168-0072(93)90234-5openalex-snapshot
Splitting theorems in recursion theory
inferredcites →https://doi.org/10.1016/b978-0-7204-2233-7.50038-1openalex-snapshot
APPLICATIONS OF MODEL THEORY TO DEGREES OF UNSOLVABILITY
inferredcites →https://doi.org/10.1017/s0022481200027961openalex-snapshot
Degree theoretical splitting properties of recursively enumerable sets
inferredcites →https://doi.org/10.1017/s0022481200031133openalex-snapshot
Lattice embeddings into the recursively enumerable degrees
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-1973-0398805-7openalex-snapshot
A Completely Mitotic Nonrecursive R.E. Degree
inferredcites →https://doi.org/10.1090/s0002-9947-1984-0719661-8openalex-snapshot
An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees
inferredcites →https://doi.org/10.1112/plms/s3-16.1.537openalex-snapshot
Lower Bounds for Pairs of Recursively Enumerable Degrees
inferredcites →https://doi.org/10.1215/ijm/1255987056openalex-snapshot
Array nonrecursive degrees and lattice embeddings of the diamond
inferredcites →https://doi.org/10.2140/pjm.1972.40.605openalex-snapshot
Degrees of members of Π10classes
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/2269807openalex-snapshot
A minimal pair of recursively enumerable degrees
inferredcites →https://doi.org/10.2307/2270510openalex-snapshot
Axiomatizable theories with few axiomatizable extensions
inferredcites →https://doi.org/10.2307/2272056openalex-snapshot
Mitotic recursively enumerable sets
inferredcites →https://doi.org/10.2307/2272849openalex-snapshot
Minimal pairs and high recursively enumerable degrees
inferredcites →https://doi.org/10.2307/2273300openalex-snapshot
Bounding minimal pairs
inferredcites →https://doi.org/10.2307/2274738openalex-snapshot
Lattice embeddings into the recursively enumerable degrees. II
inferredcites →https://doi.org/10.2307/2275099openalex-snapshot
Working below a high recursively enumerable degree
inferredcites →https://doi.org/10.2307/2275754openalex-snapshot
Degree theoretic definitions of the low2 recursively enumerable sets

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.200310092openalex-snapshot
Lattice embeddings and array noncomputable degrees
inferred← citeshttps://doi.org/10.1007/11750321_3openalex-snapshot
Totally < ω ω Computably Enumerable and m-topped Degrees
inferred← citeshttps://doi.org/10.1007/978-3-662-22108-2_2openalex-snapshot
Intervals Without Critical Triples
inferred← citeshttps://doi.org/10.1016/s0049-237x(99)80022-6openalex-snapshot
The Recursively Enumerable Degrees
inferred← citeshttps://doi.org/10.1016/s0168-0072(01)00091-4openalex-snapshot
A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees preserving greatest element
inferred← citeshttps://doi.org/10.1016/s0168-0072(97)00071-7openalex-snapshot
A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees
inferred← citeshttps://doi.org/10.1017/9781316716830.005openalex-snapshot
Intervals without Critical Triples
inferred← citeshttps://doi.org/10.1017/bsl.2017.41openalex-snapshot
A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES
inferred← citeshttps://doi.org/10.1017/cbo9781107338579.005openalex-snapshot
Computability theory, algorithmic randomness and Turing's anticipation
inferred← citeshttps://doi.org/10.1057/s41261-020-00141-1openalex-snapshot
Financial governance in a neoliberal era: controlling the banks by controlling their managerial recruitment sources
inferred← citeshttps://doi.org/10.1142/s0219061307000640openalex-snapshot
TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES
inferred← citeshttps://doi.org/10.2178/bsl/1122038994openalex-snapshot
The Role of True Finiteness in the Admissible Recursively Enumerable Degrees
inferred← citeshttps://doi.org/10.2178/jsl/1190150052openalex-snapshot
Maximal contiguous 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.