On the public citation graph

Embeddings and extensions of embeddings in the r.e. tt and wtt-degrees

https://doi.org/10.1007/bfb0076217
0 signed · 31 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.1007/978-3-662-21755-9openalex-snapshot
Degrees of Unsolvability
inferredcites →https://doi.org/10.1007/bf02482893openalex-snapshot
Every finite lattice can be embedded in a finite partition lattice
inferredcites →https://doi.org/10.1007/bfb0059544openalex-snapshot
Embedding nondistributive lattices in the recursively enumerable degrees
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.1017/cbo9780511629181.002openalex-snapshot
Fundamental Methods for Constructing 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-9939-1982-0637179-1openalex-snapshot
Finitely generated codings and the degrees r.e. in a degree 𝑑
inferredcites →https://doi.org/10.1090/s0273-0979-1981-14863-1openalex-snapshot
Strong reducibilities
inferredcites →https://doi.org/10.1090/s0273-0979-1982-14970-9openalex-snapshot
The undecidability of the recursively enumerable degrees
inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
inferredcites →https://doi.org/10.2140/pjm.1969.29.351openalex-snapshot
Initial segments of one-one degrees
inferredcites →https://doi.org/10.2307/2273658openalex-snapshot
Wtt-degrees and T-degrees of r.e. sets
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.
inferredcites →https://doi.org/10.4153/cjm-1970-010-6openalex-snapshot
Initial Segments of Many-One 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.1007/bf01621095openalex-snapshot
Working below a low2 recursively enumerably degree
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/0304-3975(92)90078-topenalex-snapshot
The p-T-degrees of the recursive sets: lattice embeddings, extensions of embeddings and the two-quantifier theory
inferred← citeshttps://doi.org/10.1016/j.ic.2017.07.005openalex-snapshot
Where join preservation fails in the bounded Turing degrees of c.e. sets
inferred← citeshttps://doi.org/10.1016/s0049-237x(99)80019-6openalex-snapshot
Reducibilities
inferred← citeshttps://doi.org/10.1016/s0168-0072(97)00067-5openalex-snapshot
Lattice representations for computability theory
inferred← citeshttps://doi.org/10.1090/s0002-9939-1988-0938684-6openalex-snapshot
Two Theorems on Truth Table Degrees
inferred← citeshttps://doi.org/10.1090/s0002-9947-1987-0882702-4openalex-snapshot
Lattice Embeddings in the Recursively Enumerable Truth Table Degrees
inferred← citeshttps://doi.org/10.1109/sct.1989.41804openalex-snapshot
The P-T-degrees of the recursive sets: lattice embeddings, extensions of embeddings and the two quantifier theory
inferred← citeshttps://doi.org/10.1142/s0219061305000432openalex-snapshot
ON EXTENSIONS OF EMBEDDINGS INTO THE ENUMERATION DEGREES OF THE ${\Sigma_2^0}$-SETS
inferred← citeshttps://doi.org/10.1305/ndjfl/1093637938openalex-snapshot
Infima of recursively enumerable truth table degrees.
inferred← citeshttps://doi.org/10.2307/2274468openalex-snapshot
Undecidability and initial segments of the (r.e.) tt-degrees
inferred← citeshttps://doi.org/10.2307/2275099openalex-snapshot
Working below a high recursively enumerable degree
inferred← citeshttps://doi.org/10.2307/2275790openalex-snapshot
Decidability of the two-quantifier theory of the recursively enumerable weak truth-table degrees and other distributive upper semi-lattices
inferred← citeshttps://doi.org/10.2307/3062109openalex-snapshot
Extension of Embeddings in the Computably Enumerable 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.