Show simple item record

dc.contributor.authorMehlhorn, Kurten_US
dc.date.accessioned2007-04-19T18:29:18Z
dc.date.available2007-04-19T18:29:18Z
dc.date.issued1973-05en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR73-170en_US
dc.identifier.urihttps://hdl.handle.net/1813/5992
dc.description.abstractWe use constructive measure theory to show the decidability pf the "almost all" theory of subrecursive degrees. The formulas of this theory are built up using the constant 0 standing for the minimum degree, the functions $\cup,\cap$ standing for the join and meet of two degrees respectively, the relation $\leq$ standing for the reducibility-ordering, the logical connectives "ampersand", $\neg$ and the quantifier (almost $\forall$ a). An efficient decision procedure is described.en_US
dc.format.extent1419638 bytes
dc.format.extent409419 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleThe "Almost All" Theory of Subrecursive Degrees is Decidableen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics