scientific article; zbMATH DE number 3304986

MaRDI QIDQ5586291zbMATHFDO

Authors Joseph R. Shoenfield

Publication date 1965

zbMATH Keywords

constructive mathematicsrecursion theory

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Cited in

(13)

• The density of the nonbranching degrees
• Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree
• Incomparable prime ideals of recursively enumerable degrees
• The $\Pi _3$-theory of the computably enumerable Turing degrees is undecidable
• Branching Degrees above low Degrees
• Undecidability and 1-types in the recursively enumerable degrees
• A thread calculus with molecular dynamics
• Recursively enumerable sets and degrees
• Lattice nonembeddings and intervals of the recursively enumerable degrees
• The Quotient Semilattice of the Recursively Enumerable Degrees Modulo the Cappable Degrees
• The decision problem for recursively enumerable degrees
• On Lachlan's major sub-degree problem
• An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5586291)