On restricted forms of enumeration reducibility

Watson, P. (1990) On restricted forms of enumeration reducibility. Annals of Pure and Applied Logic, 49 . pp. 75-96. (The full text of this publication is not available from this repository)

The full text of this publication is not available from this repository. (Contact us about this Publication)
Item Type: Article
Uncontrolled keywords: recursive function theory, degree theory
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group
Depositing User: Mark Wheadon
Date Deposited: 31 Jul 2009 20:01
Last Modified: 31 Jul 2009 20:01
Resource URI: http://kar.kent.ac.uk/id/eprint/20978 (The current URI for this page, for reference purposes)
  • Depositors only (login required):