On the public citation graph

Embedding nondistributive lattices in the recursively enumerable degrees

https://doi.org/10.1007/bfb0059544
0 signed · 67 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.1112/plms/s3-16.1.537openalex-snapshot
Lower Bounds for Pairs of Recursively Enumerable Degrees
inferredcites →https://doi.org/10.2307/2269807openalex-snapshot
A minimal pair of recursively enumerable degrees

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.19890350102openalex-snapshot
Embedding Lattices with Top Preserved Below Non‐GL2 Degrees
inferred← citeshttps://doi.org/10.1002/malq.19940400115openalex-snapshot
A New Reducibility between Turing‐ and wtt‐Reducibility
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/11780342_23openalex-snapshot
Enumeration Reducibility with Polynomial Time Bounds
inferred← citeshttps://doi.org/10.1007/978-1-4612-0325-4_2openalex-snapshot
Embedding Distributive Lattices Preserving 1 below a Nonzero Recursively Enumerable Turing Degree
inferred← citeshttps://doi.org/10.1007/978-3-642-11072-6_5openalex-snapshot
Constructions in the Recursively Enumerable Degrees
inferred← citeshttps://doi.org/10.1007/978-3-662-02460-7openalex-snapshot
Recursively Enumerable Sets and Degrees
inferred← citeshttps://doi.org/10.1007/bf02007561openalex-snapshot
Cupping and noncapping in the r.e. weak truth table and turing degrees
inferred← citeshttps://doi.org/10.1007/bf02762706openalex-snapshot
Lattice embeddings below a nonlow2 recursively enumerable degree
inferred← citeshttps://doi.org/10.1007/bf02808174openalex-snapshot
Branching in the enumeration degrees of the Σ 2 0 sets
inferred← citeshttps://doi.org/10.1007/bfb0076217openalex-snapshot
Embeddings and extensions of embeddings in the r.e. tt and wtt-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/bfb0086116openalex-snapshot
Array nonrecursive sets and multiple permitting arguments
inferred← citeshttps://doi.org/10.1007/bfb0099477openalex-snapshot
Contiguous R.E. Degrees
inferred← citeshttps://doi.org/10.1007/s00153-008-0083-5openalex-snapshot
On Lachlan’s major sub-degree problem
inferred← citeshttps://doi.org/10.1007/s001530050063openalex-snapshot
Conjectures and questions from Gerald Sacks's Degrees of Unsolvability
inferred← citeshttps://doi.org/10.1016/0001-8708(80)90027-4openalex-snapshot
Not every finite lattice is embeddable in the recursively enumerable degrees
inferred← citeshttps://doi.org/10.1016/0168-0072(86)90071-0openalex-snapshot
Structural interactions of the recursively enumerable T- and W-degrees
inferred← citeshttps://doi.org/10.1016/0168-0072(89)90005-5openalex-snapshot
Intervals and sublattices of the R.E. weak truth table degrees, part I: Density
inferred← citeshttps://doi.org/10.1016/0168-0072(89)90042-0openalex-snapshot
The recursively enumerable degrees have infinitely many one-types
inferred← citeshttps://doi.org/10.1016/0168-0072(89)90051-1openalex-snapshot
Classifications of degree classes associated with r.e. subspaces
inferred← citeshttps://doi.org/10.1016/0168-0072(90)90062-7openalex-snapshot
Lattice nonembeddings and initial segments of the recursively enumerable degrees
inferred← citeshttps://doi.org/10.1016/0168-0072(93)90207-topenalex-snapshot
Incomparable prime ideals of recursively enumerable degrees
inferred← citeshttps://doi.org/10.1016/0168-0072(93)90220-8openalex-snapshot
Lattice nonembeddings and intervals of the recursively enumerable degrees
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50010-1openalex-snapshot
Degrees of Unsolvability
inferred← citeshttps://doi.org/10.1016/j.apal.2007.11.014openalex-snapshot
On strongly jump traceable reals
inferred← citeshttps://doi.org/10.1016/s0049-237x(06)80044-3openalex-snapshot
Lattice embeddings into the R.E. Degrees preserving 1
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71117-0openalex-snapshot
Degrees of Unsolvability: A Survey of Results
inferred← citeshttps://doi.org/10.1016/s0049-237x(99)80020-2openalex-snapshot
Local Degree Theory* *Preparation of this paper partially supported by E.P.S.R.C. research grants nos. GR/H91213 and GR/H02165, and by EC Human Capital and Mobility network ‘Complexity, Logic and Recursion Theory’.
inferred← citeshttps://doi.org/10.1016/s0049-237x(99)80022-6openalex-snapshot
The Recursively Enumerable Degrees
inferred← citeshttps://doi.org/10.1016/s0168-0072(00)00021-xopenalex-snapshot
Interpreting N in the computably enumerable weak truth table degrees
inferred← citeshttps://doi.org/10.1016/s0168-0072(01)00028-8openalex-snapshot
Embeddings of N5 and the contiguous 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(98)00013-xopenalex-snapshot
Computably enumerable sets and quasi-reducibility
inferred← citeshttps://doi.org/10.1017/9781316716830.005openalex-snapshot
Intervals without Critical Triples
inferred← citeshttps://doi.org/10.1017/9781316755723.010openalex-snapshot
Embedding finite lattices into the computably enumerable degrees — a status survey
inferred← citeshttps://doi.org/10.1017/bsl.2017.41openalex-snapshot
A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES
inferred← citeshttps://doi.org/10.1017/cbo9780511750779openalex-snapshot
A Framework for Priority Arguments
inferred← citeshttps://doi.org/10.1017/cbo9781107338579.005openalex-snapshot
Computability theory, algorithmic randomness and Turing's anticipation
inferred← citeshttps://doi.org/10.1017/s0022481200027961openalex-snapshot
Degree theoretical splitting properties of recursively enumerable sets
inferred← citeshttps://doi.org/10.1017/s0022481200031133openalex-snapshot
Lattice embeddings into the recursively enumerable degrees
inferred← citeshttps://doi.org/10.1090/memo/1284openalex-snapshot
Minimal Weak Truth Table Degrees and Computably Enumerable Turing Degrees
inferred← citeshttps://doi.org/10.1090/s0002-9904-1975-13876-6openalex-snapshot
The decision problem for recursively enumerable degrees
inferred← citeshttps://doi.org/10.1090/s0002-9904-1978-14552-2openalex-snapshot
Recursively enumerable sets and degrees
inferred← citeshttps://doi.org/10.1142/s0219061307000640openalex-snapshot
TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES
inferred← citeshttps://doi.org/10.1201/b21197-9openalex-snapshot
Peano Arithmetic Models and Computability
inferred← citeshttps://doi.org/10.1305/ndjfl/1093637938openalex-snapshot
Infima of recursively enumerable truth table degrees.
inferred← citeshttps://doi.org/10.1305/ndjfl/1179323263openalex-snapshot
On the Symmetric Enumeration Degrees
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/bsl/1154698739openalex-snapshot
Degree Structures: Local and Global Investigations
inferred← citeshttps://doi.org/10.2178/jsl/1190150030openalex-snapshot
Embedding finite lattices into the Σ20 enumeration degrees
inferred← citeshttps://doi.org/10.2307/2273658openalex-snapshot
Wtt-degrees and T-degrees of r.e. sets
inferred← citeshttps://doi.org/10.2307/2273946openalex-snapshot
Splitting properties of r.e. sets and degrees
inferred← citeshttps://doi.org/10.2307/2273985openalex-snapshot
On minimal pairs of enumeration degrees
inferred← citeshttps://doi.org/10.2307/2274738openalex-snapshot
Lattice embeddings into the recursively enumerable degrees. II
inferred← citeshttps://doi.org/10.2307/2275436openalex-snapshot
The theory of the recursively enumerable weak truth-table degrees is undecidable
inferred← citeshttps://doi.org/10.2307/2275539openalex-snapshot
Generalized nonsplitting in the recursively enumerable degrees
inferred← citeshttps://doi.org/10.2307/2275639openalex-snapshot
Contiguity and distributivity in the enumerable Turing degrees
inferred← citeshttps://doi.org/10.2307/2275708openalex-snapshot
Initial segments of the lattice of ideals of r.e. degrees
inferred← citeshttps://doi.org/10.2307/421171openalex-snapshot
Definability in the Recursively Enumerable Degrees
inferred← citeshttps://doi.org/10.3233/com-190269openalex-snapshot
Nonlowness is independent from fickleness
inferred← citeshttps://doi.org/10.48550/arxiv.1906.06381openalex-snapshot
Nonlowness independent from frequent mind changes
inferred← citeshttps://doi.org/10.53733/133openalex-snapshot
Hierarchy of Computably Enumerable Degrees II
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.