The computably enumerable sets: recent results and future directions
From MaRDI portal
Publication:5483300
zbMATH Open1105.03034MaRDI QIDQ5483300FDOQ5483300
Authors: Peter A. Cholak
Publication date: 16 August 2006
Recommendations
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Recursively (computably) enumerable sets and degrees (03D25) Future perspectives in mathematics (01A67)
Cited In (13)
- Orbits of computably enumerable sets: Low sets can avoid an upper cone
- Title not available (Why is that?)
- Some recent research directions in the computably enumerable sets
- Comparing C.E. Sets Based on Their Settling Times
- Title not available (Why is that?)
- Computably enumerable sets below random sets
- Computably enumerable sets and related issues
- On the orbits of computably enumerable sets
- A journey to computably enumerable structures (tutorial lectures)
- Computably enumerable sets and quasi-reducibility
- The Complexity of Orbits of Computably Enumerable Sets
- ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS
- Computably enumerable sets that are automorphic to low sets
This page was built for publication: The computably enumerable sets: recent results and future directions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5483300)