A Cappable Almost Everywhere Dominating Computably Enumerable Degree (Q4921434): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.entcs.2006.08.005 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2008969089 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding paths through narrow and wide trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On a conjecture of Dobrinen and Simpson concerning almost everywhere domination / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Uniform almost everywhere domination / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Almost everywhere domination / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4040892 / rank | |||
Normal rank | |||
Latest revision as of 09:55, 6 July 2024
scientific article; zbMATH DE number 6162034
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Cappable Almost Everywhere Dominating Computably Enumerable Degree |
scientific article; zbMATH DE number 6162034 |
Statements
A Cappable Almost Everywhere Dominating Computably Enumerable Degree (English)
0 references
10 May 2013
0 references
almost everywhere domination
0 references
minimal pairs
0 references
Turing degrees
0 references
computably enumerable degrees
0 references
