An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees (Q3325709): Difference between revisions

Latest revision as of 11:53, 14 June 2024

scientific article

Language	Label	Description	Also known as
English	An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees	scientific article

Statements

0 references

0 references

Carl G. jun. Jockusch

0 references

Richard A. Shore

0 references

Robert I. Soare

0 references

publication date

1984

0 references

zbMATH Keywords

recursively enumerable degrees

0 references

promptly simple degrees

0 references

upper semilattice

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.2307/1999525

0 references

title

An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees (English)

0 references

0 references

0 references

0 references

Lower Bounds for Pairs of Recursively Enumerable Degrees

0 references

Degrees of recursively enumerable sets which have no maximal supersets

0 references

Bounding minimal pairs

0 references

The weak truth table degrees of recursively enumerable sets

0 references

Recursively enumerable generic sets

0 references

Splitting properties and jump classes

0 references

Jump restricted interpolation in the recursively enumerable degrees

0 references

The recursively enumerable degrees are dense

0 references

Degrees of Unsolvability. (AM-55)

0 references

Q5586291

0 references

Degrees of classes of RE sets

0 references

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

0 references

The infinite injury priority method

0 references

Computational complexity, speedable and levelable sets

0 references

Recursively enumerable sets and degrees

0 references

Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets

0 references

Computational complexity of recursively enumerable sets

0 references

A minimal pair of recursively enumerable degrees

0 references

Identifiers

zbMATH Open document ID

0539.03020

0 references

DOI

10.2307/1999525

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3325709

@@ label / en / label / en @@
+An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.2307/1999525
@@ Property / full work available at URL: https://doi.org/10.2307/1999525 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W4233349789
@@ Property / OpenAlex ID: W4233349789 / rank @@
+Normal rank
@@ Property / title @@
+An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees (English)
+Normal rank
@@ Property / cites work @@
+Q3942948
@@ Property / cites work: Q3942948 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3315502
@@ Property / cites work: Q3315502 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3962983
@@ Property / cites work: Q3962983 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower Bounds for Pairs of Recursively Enumerable Degrees
+Normal rank
@@ Property / cites work @@
+Degrees of recursively enumerable sets which have no maximal supersets
+Normal rank
@@ Property / cites work @@
+Bounding minimal pairs
@@ Property / cites work: Bounding minimal pairs / rank @@
+Normal rank
@@ Property / cites work @@
+The weak truth table degrees of recursively enumerable sets
+Normal rank
@@ Property / cites work @@
+Recursively enumerable generic sets
@@ Property / cites work: Recursively enumerable generic sets / rank @@
+Normal rank
@@ Property / cites work @@
+Splitting properties and jump classes
@@ Property / cites work: Splitting properties and jump classes / rank @@
+Normal rank
@@ Property / cites work @@
+Jump restricted interpolation in the recursively enumerable degrees
+Normal rank
@@ Property / cites work @@
+The recursively enumerable degrees are dense
@@ Property / cites work: The recursively enumerable degrees are dense / rank @@
+Normal rank
@@ Property / cites work @@
+Degrees of Unsolvability. (AM-55)
@@ Property / cites work: Degrees of Unsolvability. (AM-55) / rank @@
+Normal rank
@@ Property / cites work @@
+Q5586291
@@ Property / cites work: Q5586291 / rank @@
+Normal rank
@@ Property / cites work @@
+Degrees of classes of RE sets
@@ Property / cites work: Degrees of classes of RE sets / rank @@
+Normal rank
@@ Property / cites work @@
+Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
+Normal rank
@@ Property / cites work @@
+The infinite injury priority method
@@ Property / cites work: The infinite injury priority method / rank @@
+Normal rank
@@ Property / cites work @@
+Computational complexity, speedable and levelable sets
+Normal rank
@@ Property / cites work @@
+Recursively enumerable sets and degrees
@@ Property / cites work: Recursively enumerable sets and degrees / rank @@
+Normal rank
@@ Property / cites work @@
+Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets
+Normal rank
@@ Property / cites work @@
+Computational complexity of recursively enumerable sets
+Normal rank
@@ Property / cites work @@
+A minimal pair of recursively enumerable degrees
@@ Property / cites work: A minimal pair of recursively enumerable degrees / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3325709