Watson, Phil (1990) On restricted forms of enumeration reducibility. Annals of Pure and Applied Logic, 49 . pp. 75-96. (doi:10.1016/0168-0072(90)90051-3) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:20978)
| The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided. | |
| Official URL: https://doi.org/10.1016/0168-0072(90)90051-3 |
|
| Item Type: | Article |
|---|---|
| DOI/Identification number: | 10.1016/0168-0072(90)90051-3 |
| Uncontrolled keywords: | recursive function theory, degree theory |
| Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
| Institutional Unit: | Schools > School of Computing |
| Former Institutional Unit: |
Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
|
| Depositing User: | Mark Wheadon |
| Date Deposited: | 31 Jul 2009 20:01 UTC |
| Last Modified: | 20 May 2025 10:07 UTC |
| Resource URI: | https://kar.kent.ac.uk/id/eprint/20978 (The current URI for this page, for reference purposes) |
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):
Altmetric
Altmetric
