Diagonals and semihyperhypersimple sets

DOI10.2307/2275073zbMATH Open0747.03019OpenAlexW2077107644MaRDI QIDQ3985103FDOQ3985103

Author name not available (Why is that?)

Publication date: 27 June 1992

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2275073

zbMATH Keywords

diagonalscomputable numberingsnumbering of partial recursive functionssemi-hyperhypersimple setsTuring-degree

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Recursive functions and relations, subrecursive hierarchies (03D20)

Cited In (6)

• Splitting theorems in recursion theory
• On Splits of Computably Enumerable Sets
• On thick diagonals and their complements
• Title not available (Why is that?)
• Extension theorems, orbits, and automorphisms of the computably enumerable sets
• Some orbits for \({\mathcal E}\)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Hyperplane arrangements and diagonal harmonics 👍 👎
• Hyperdeterminants on semilattices 👍 👎
• Diametrically complete sets and normal structure 👍 👎
• Diagonals and -maximal sets 👍 👎
• Diagonal complexes 👍 👎
• On a class of hypergeometric diagonals 👍 👎
• Diagonals of positive semigroups 👍 👎

This page was built for publication: Diagonals and semihyperhypersimple sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3985103)