Some orbits for \({\mathcal E}\) (Q1840464): Difference between revisions

The reviewed paper contains a description of some new orbits in the lattice of computably enumerable sets modulo different equivalence relations, extending the collection of the known orbits. It seems that all of the content of the paper is a proof of several conjectures raised by the third author in 1989 in a private communication to the first two authors.

0 references

reviewed by

Sh. T. Ishmukhametov

0 references

zbMATH Keywords

computably enumerable

0 references

automorphism

0 references

maximal

0 references

definable

0 references

orbits

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

The translation theorem

0 references

Automorphisms of the lattice of recursively enumerable sets

0 references

Automorphisms of the Lattice of Recursively Enumerable Sets: Promptly Simple Sets

0 references

Minimal pairs and high recursively enumerable degrees

0 references

A jump class of noncappable degrees

0 references

Minimal 1-degrees and truth-table reducibility

0 references

There is no fat orbit

0 references

Jumps of Hemimaximal Sets

0 references

Automorphisms of the lattice of recursively enumerable sets: Orbits

0 references

Splitting theorems in recursion theory

0 references

Post's program and incomplete recursively enumerable sets.

0 references

The Δ₃⁰-automorphism method and noninvariant classes of degrees

0 references

Codable sets and orbits of computably enumerable sets

0 references

Q3773863

0 references

Diagonals and -maximal sets

0 references

Diagonals and semihyperhypersimple sets

0 references

Recursively enumerable generic sets

0 references

Classes of Recursively Enumerable Sets and Degrees of Unsolvability

0 references

Classical recursion theory. Vol. II

0 references

Recursion, metarecursion, and inclusion

0 references

Q5573961

0 references

A non-inversion theorem for the jump operator

0 references

Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets

0 references

Q4040892

0 references

Identifiers

zbMATH Open document ID

0969.03051

0 references

DOI

10.1016/S0168-0072(00)00060-9

0 references

Mathematics Subject Classification ID

03D25

0 references

zbMATH DE Number

1562996

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1840464

@@ Property / author @@
+Peter A. Cholak
@@ Property / author: Peter A. Cholak / rank @@
+Normal rank
@@ Property / author @@
+Rodney G. Downey
@@ Property / author: Rodney G. Downey / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+The translation theorem
@@ Property / cites work: The translation theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Automorphisms of the lattice of recursively enumerable sets
+Normal rank
@@ Property / cites work @@
+Automorphisms of the Lattice of Recursively Enumerable Sets: Promptly Simple Sets
+Normal rank
@@ Property / cites work @@
+Minimal pairs and high recursively enumerable degrees
+Normal rank
@@ Property / cites work @@
+A jump class of noncappable degrees
@@ Property / cites work: A jump class of noncappable degrees / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal 1-degrees and truth-table reducibility
@@ Property / cites work: Minimal 1-degrees and truth-table reducibility / rank @@
+Normal rank
@@ Property / cites work @@
+There is no fat orbit
@@ Property / cites work: There is no fat orbit / rank @@
+Normal rank
@@ Property / cites work @@
+Jumps of Hemimaximal Sets
@@ Property / cites work: Jumps of Hemimaximal Sets / rank @@
+Normal rank
@@ Property / cites work @@
+Automorphisms of the lattice of recursively enumerable sets: Orbits
+Normal rank
@@ Property / cites work @@
+Splitting theorems in recursion theory
@@ Property / cites work: Splitting theorems in recursion theory / rank @@
+Normal rank
@@ Property / cites work @@
+Post's program and incomplete recursively enumerable sets.
+Normal rank
@@ Property / cites work @@
+The Δ₃⁰-automorphism method and noninvariant classes of degrees
+Normal rank
@@ Property / cites work @@
+Codable sets and orbits of computably enumerable sets
+Normal rank
@@ Property / cites work @@
+Q3773863
@@ Property / cites work: Q3773863 / rank @@
+Normal rank
@@ Property / cites work @@
+Diagonals and -maximal sets
@@ Property / cites work: Diagonals and -maximal sets / rank @@
+Normal rank
@@ Property / cites work @@
+Diagonals and semihyperhypersimple sets
@@ Property / cites work: Diagonals and semihyperhypersimple sets / rank @@
+Normal rank
@@ Property / cites work @@
+Recursively enumerable generic sets
@@ Property / cites work: Recursively enumerable generic sets / rank @@
+Normal rank
@@ Property / cites work @@
+Classes of Recursively Enumerable Sets and Degrees of Unsolvability
+Normal rank
@@ Property / cites work @@
+Classical recursion theory. Vol. II
@@ Property / cites work: Classical recursion theory. Vol. II / rank @@
+Normal rank
@@ Property / cites work @@
+Recursion, metarecursion, and inclusion
@@ Property / cites work: Recursion, metarecursion, and inclusion / rank @@
+Normal rank
@@ Property / cites work @@
+Q5573961
@@ Property / cites work: Q5573961 / rank @@
+Normal rank
@@ Property / cites work @@
+A non-inversion theorem for the jump operator
@@ Property / cites work: A non-inversion theorem for the jump operator / rank @@
+Normal rank
@@ Property / cites work @@
+Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
+Normal rank
@@ Property / cites work @@
+Q4040892
@@ Property / cites work: Q4040892 / rank @@
+Normal rank