Rogers semilattices for families of equivalence relations in the Ershov hierarchy (Q2313294)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7082356
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Rogers semilattices for families of equivalence relations in the Ershov hierarchy |
scientific article; zbMATH DE number 7082356 |
Statements
Rogers semilattices for families of equivalence relations in the Ershov hierarchy (English)
0 references
18 July 2019
0 references
The authors discuss Rogers semilattices of degrees of numberings of equivalence relations. The main results are: (1) at each level of the Ershov hierarchy, there exists an infinite collection of pairwise incomparable Friedberg orderings, and (2) the same, with ``Friedberg'' replaced by ``positive undecidable''.
0 references
Rogers semilattice
0 references
Ershov hierarchy
0 references
equivalence relation
0 references
computable numbering
0 references
Friedberg numbering
0 references
minimal numbering
0 references
universal numbering
0 references
principal ideal
0 references
0 references
0 references
0.9118048
0 references
0.90893424
0 references
0.90454304
0 references
0.8972495
0 references
0.8889088
0 references
0.8868164
0 references
0.8824805
0 references
0.8736712
0 references
