JavaScript is disabled for your browser. Some features of this site may not work without it.
The "Almost All" Theory of Subrecursive Degrees is Decidable
| dc.contributor.author | Mehlhorn, Kurt | en_US |
| dc.date.accessioned | 2007-04-19T18:29:18Z | |
| dc.date.available | 2007-04-19T18:29:18Z | |
| dc.date.issued | 1973-05 | en_US |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR73-170 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/5992 | |
| dc.description.abstract | We 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.extent | 1419638 bytes | |
| dc.format.extent | 409419 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | The "Almost All" Theory of Subrecursive Degrees is Decidable | en_US |
| dc.type | technical report | en_US |
