A maximal set which is not complete

DOI10.1307/MMJ/1028999130MaRDI QIDQ2521032zbMATH OpenOpenAlexFDO

Authors Gerald E. Sacks

Publication date 1964

Published in Michigan Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1307/mmj/1028999130

zbMATH Keywords

mathematical logic

Cited in

(13)

• m-powers of simple sets
• On effectively hypersimple sets
• Sets without subsets of higher many-one degree
• Automorphisms of the lattice of _1⁰ classes; perfect thin classes and anc degrees
• Schnorr trivial sets and truth-table reducibility
• On the Relations between Some Rate-of-Growth Conditions
• Recursively enumerable sets and degrees
• Automorphisms of the lattice of recursively enumerable sets
• On the Degrees of Index Sets
• Two Theorems on Hyperhypersimple Sets
• On the Degrees of Index Sets. II
• Simplicity of recursively enumerable sets
• Metarecursively enumerable sets and their metadegrees

This page was built for publication: A maximal set which is not complete

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