Quasicreative Sets
From MaRDI portal
Publication:3248016
DOI10.2307/2033701zbMATH Open0080.24401OpenAlexW4235794029MaRDI QIDQ3248016FDOQ3248016
Authors: Joseph R. Shoenfield 
Publication date: 1957
Full work available at URL: https://doi.org/10.2307/2033701
Cited In (9)
- Structural properties of \(Q\)-degrees of n-c.e. sets
- Embedding the Diamond Lattice in the Recursively Enumerable Truth-Table Degrees
- On Semi-Cylinders, Splinters, and Bounded-Truth-Table Reducibility
- On complete btt-degrees
- Computably enumerable sets and quasi-reducibility
- Completeness, the Recursion Theorem, and Effectively Simple Sets
- Recursively enumerable sets and degrees
- A remark on semiproductive sets
- A Note on Bounded-Truth-Table Reducibility
This page was built for publication: Quasicreative Sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3248016)
