scientific article; zbMATH DE number 749930
From MaRDI portal
Publication:4764111
zbMath0820.03024MaRDI QIDQ4764111
Publication date: 11 September 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
combinatoricsTuring degreesr.e. degreepriority argumentCooper-Lachlan-Epstein theoremFriedberg Muchnik theoremlow simple setsSacks minimal degree theoremShoenfield jump inversion theorem
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items (2)
Relatively Recursively Enumerable Versus Relatively Σ1 in Models of Peano Arithmetic ⋮ Coding a family of sets
This page was built for publication:
