scientific article

zbMath0306.02040MaRDI QIDQ4063428

Thomas G. McLaughlin

Publication date: 1972

Full work available at URL: http://www.numdam.org/item?id=CM_1972__24_1_83_0

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Hierarchies of computability and definability (03D55)

Related Items (2)

Rogers semilattices of limitwise monotonic numberings ⋮ Discrete families of recursive functions and index sets

Cites Work

• Unnamed Item
• Computing degrees of unsolvability
• Some Theorems on Classes of Recursively Enumerable Sets
• The Family of all Recursively Enumerable Classes of Finite Sets
• Classes of Recursively Enumerable Sets and Their Decision Problems

This page was built for publication: