The \almost all" theory of subrecursive degrees is decidable (1974)

by K Mehlhorn
Venue:In Proceedings of the Second Colloquium on Automata, Languages, and Programming