Positive undecidable numberings in the Ershov hierarchy (Q695803): Difference between revisions
From MaRDI portal
Removed claims |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Manat Mustafa / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Andrea Sorbi / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2033860122 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4451656 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2709299 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4133618 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4513962 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5573961 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5619076 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5619077 / rank | |||
Normal rank |
Latest revision as of 00:29, 6 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Positive undecidable numberings in the Ershov hierarchy |
scientific article |
Statements
Positive undecidable numberings in the Ershov hierarchy (English)
0 references
17 December 2012
0 references
In the paper under review the authors give a sufficient condition under which an infinite computable family of \(\Sigma^{-1}_a\) sets has computable positive but undecidable numberings. Here \(a\) is a notation for a computable ordinal \(>0\). In particular, it is shown that if \(a\) is a notation for an infinite computable ordinal and \({\mathcal A}\) is an infinite family of \(\Sigma^{-1}_a\) sets containing an \(n\)-c.e. set, then \({\mathcal A}\) has infinitely many computable positive undecidable numberings, which are pairwise incomparable with respect to Rogers reducibility.
0 references
Ershov hierarchy
0 references
families of \(\Sigma^{-1}_a\) sets
0 references
computable ordinals
0 references
positive numberings
0 references
Rogers reducibility
0 references