Author:
Bäuerle Frank A.,Remmel Jeffrey B.
Reference24 articles.
1. Decidable subspaces and recursively enumerable subspaces;Ash;J. Symbolic Logic,1984
2. PhD thesis;Bäuerle,1994
3. Information content of complexity theoretic properties;Bennison,1979
4. A machine independent theory of the complexity of recursive functions;Blum;J. Assoc. Comput. Mach.,1967
5. On complexity properties of recursively enumerable sets;Blum;J. Symbolic Logic,1973
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献