Mathematical logic and foundations Computability theory Concept
Priority method
Summary
The priority method is a technique to build computably enumerable sets with prescribed properties. The desired property is split into infinitely many requirements, ordered by priority, and the set is built in stages. When requirements conflict, the one of higher priority wins, and a requirement that loses is injured and starts again. It was introduced to solve Post's problem and is the main tool for constructions in the theory of Turing degrees.
Further reading
About this page
| Tag | 3BZFSC5QZ2 |
|---|---|
| URI | m2://3BZFSC5QZ2 |
| Kind | concept |
| Writing | W0 stub |
| MSC | 03D25, 03D28 |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.