Coding a family of sets (Q1295408): Difference between revisions

A metatheorem for coding a family of sets into a family of relations (or, into a sole relation) is obtained. As an application one proves that the set of limit points in a recursive ordering of type \(\omega^2\) can have arbitrary 2-REA degree.

0 references

Mathematics Subject Classification ID

03D45

0 references

0 references

0 references

recursive ordering

0 references

coding

0 references

limit points

0 references

0 references

0 references

MaRDI publication profile

0 references

cites work

Stability of recursive structures in arithmetical degrees

0 references

Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees

0 references

Labelling systems and r.e. structures

0 references

Relatively recursive expansions

0 references

Mixed systems

0 references

Ramified systems

0 references

Possible degrees in recursive copies

0 references

Possible degrees in recursive copies. II

0 references

Computable structures and the hyperarithmetical hierarchy

0 references

Q3919698

0 references

Intrinsically \(\Sigma ^ 0_{\alpha}\) relations

0 references

TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)

0 references

The Sacks density theorem and Σ<sub>2</sub>-bounding

0 references

Some effects of Ash-Nerode and other decidability conditions on degree spectra

0 references

Q4764111

0 references

Q3480023

0 references

A General Framework for Priority Arguments

0 references

Q3232283

0 references

Non-bounding constructions

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1295408

@@ Property / cites work @@
+Stability of recursive structures in arithmetical degrees
+Normal rank
@@ Property / cites work @@
+Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
+Normal rank
@@ Property / cites work @@
+Labelling systems and r.e. structures
@@ Property / cites work: Labelling systems and r.e. structures / rank @@
+Normal rank
@@ Property / cites work @@
+Relatively recursive expansions
@@ Property / cites work: Relatively recursive expansions / rank @@
+Normal rank
@@ Property / cites work @@
+Mixed systems
@@ Property / cites work: Mixed systems / rank @@
+Normal rank
@@ Property / cites work @@
+Ramified systems
@@ Property / cites work: Ramified systems / rank @@
+Normal rank
@@ Property / cites work @@
+Possible degrees in recursive copies
@@ Property / cites work: Possible degrees in recursive copies / rank @@
+Normal rank
@@ Property / cites work @@
+Possible degrees in recursive copies. II
@@ Property / cites work: Possible degrees in recursive copies. II / rank @@
+Normal rank
@@ Property / cites work @@
+Computable structures and the hyperarithmetical hierarchy
+Normal rank
@@ Property / cites work @@
+Q3919698
@@ Property / cites work: Q3919698 / rank @@
+Normal rank
@@ Property / cites work @@
+Intrinsically \(\Sigma ^ 0_{\alpha}\) relations
@@ Property / cites work: Intrinsically \(\Sigma ^ 0_{\alpha}\) relations / rank @@
+Normal rank
@@ Property / cites work @@
+TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
+Normal rank
@@ Property / cites work @@
+The Sacks density theorem and Σ<sub>2</sub>-bounding
+Normal rank
@@ Property / cites work @@
+Some effects of Ash-Nerode and other decidability conditions on degree spectra
+Normal rank
@@ Property / cites work @@
+Q4764111
@@ Property / cites work: Q4764111 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3480023
@@ Property / cites work: Q3480023 / rank @@
+Normal rank
@@ Property / cites work @@
+A General Framework for Priority Arguments
@@ Property / cites work: A General Framework for Priority Arguments / rank @@
+Normal rank
@@ Property / cites work @@
+Q3232283
@@ Property / cites work: Q3232283 / rank @@
+Normal rank
@@ Property / cites work @@
+Non-bounding constructions
@@ Property / cites work: Non-bounding constructions / rank @@
+Normal rank