Computable numberings of families of low sets and Turing jumps in the Ershov hierarchy (Q542199): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s11202-010-0111-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2027313289 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On a hierarchy of sets. III / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Δ 2 0 -Mengen / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5494235 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Degrees of Index Sets. II / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Turing and enumeration jumps in the Ershov hierarchy / rank | |||
Normal rank | |||
Latest revision as of 04:10, 4 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computable numberings of families of low sets and Turing jumps in the Ershov hierarchy |
scientific article |
Statements
Computable numberings of families of low sets and Turing jumps in the Ershov hierarchy (English)
0 references
8 June 2011
0 references
computable numbering
0 references
Ershov hierarchy
0 references
constructive ordinal
0 references
low set
0 references
superlow set
0 references
