Bounding non-GL<sub>2</sub> and R.E.A. (Q3399188): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Combinatorial principles weaker than Ramsey's Theorem for pairs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Turing degrees of certain isomorphic images of computable relations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Lowness for genericity / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Classes of Recursively Enumerable Sets and Degrees of Unsolvability / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A 1-generic degree with a strong minimal cover / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Relative recursive enumerability of generic degrees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Jump restricted interpolation in the recursively enumerable degrees / rank | |||
Normal rank | |||
Revision as of 23:45, 1 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bounding non-GL<sub>2</sub> and R.E.A. |
scientific article |
Statements
Bounding non-GL<sub>2</sub> and R.E.A. (English)
0 references
29 September 2009
0 references
generalized high/low hierarchies
0 references
recursively enumerable in and above
0 references
generic degree
0 references
