Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

5

JSYML
2007

favoriteEmaildiscussreport

68views more JSYML 2007»

Bounding nonsplitting enumeration degrees

13 years 4 months ago

Bounding nonsplitting enumeration degrees

Download ac.marywood.edu

We show that every nonzero Σ0 2 enumeration degree bounds a nonsplitting nonzero enumeration degree.

Thomas F. Kent, Andrea Sorbi

Real-time Traffic

Enumeration Degree | JSYML 2007 | Nonzero Enumeration Degree |

claim paper

Related Content

» Upper bounds on ideals in the computably enumerable Turing degrees

» Asymptotic Enumeration Of Graphs With A Given Upper Bound On The Maximum Degree

» The ibT degrees of computably enumerable sets are not dense

» The computable Lipschitz degrees of computably enumerable sets are not dense

» Posts Programme for the Ershov Hierarchy

» Enumeration of Totally Real Number Fields of Bounded Root Discriminant

» The minimal edegree problem in fragments of Peano arithmetic

» Efficient Construction of a Bounded Degree Spanner with Low Weight

» Randomness lowness and degrees

Post Info
More Details (n/a)

Added	16 Dec 2010
Updated	16 Dec 2010
Type	Journal
Year	2007
Where	JSYML
Authors	Thomas F. Kent, Andrea Sorbi

Comments (0)