Sets of generator and automorphism bases for the enumeration degrees (Q1295393): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Zheng, Xizhong / rank | |||
Property / reviewed by | |||
Property / reviewed by: Zheng, Xizhong / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Partial degrees and the density problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3487329 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: 1-genericity in the enumeration degrees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Automorphism bases for degrees of unsolvability / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Jumps of quasi-minimal enumeration degrees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5848894 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5573961 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Definability in the enumeration degrees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4011117 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Recursively enumerable sets and degrees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On some filters and ideals of the Medvedev lattice / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 20:49, 28 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Sets of generator and automorphism bases for the enumeration degrees |
scientific article |
Statements
Sets of generator and automorphism bases for the enumeration degrees (English)
0 references
24 June 1999
0 references
A set \(A\) is enumeration reducible to a set \(B\) \((A\leq_e B)\) if there exists an effective procedure for enumerating \(A\) starting from any enumeration of \(B\). The degree structure \({\mathfrak D}_e\) originated by \(\leq_e\) is the structure of the enumeration degrees. Similar to the case of Turing degrees, there is a wide-spread discussion about the structural and global properties of \({\mathfrak D}_e\). This paper shows some interesting properties about automorphisms of enumeration degrees and exhibits several automorphism bases for \({\mathfrak D}_e\).
0 references
enumeration degrees
0 references
automorphism bases
0 references