Hypersimple sets with retraceable complements (Q2560237)

From MaRDI portal

Revision as of 12:49, 12 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Hypersimple sets with retraceable complements	scientific article

Statements

scholarly article

0 references

Hypersimple sets with retraceable complements (English)

0 references

zbMATH Open document ID

0 references

10.1007/BF02219729

0 references

Algebra and Logic

0 references

publication date

1972

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

Turing degrees and many-one degrees of maximal sets

0 references

Recursively Enumerable Sets and Retracing Functions

0 references

On the Degrees of Index Sets. II

0 references

Retraceable Sets and Recursive Permutations

0 references

Classes of Recursively Enumerable Sets and Degrees of Unsolvability

0 references

The recursively enumerable degrees are dense

0 references

Relationships Between Reducibilities

0 references

Semirecursive Sets and Positive Reducibility

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2560237

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2560237&oldid=34553629"