𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Recursion in Partial Type-1 Objects With Well-Behaved Oracles

✍ Scribed by George Tourlakis


Book ID
102941946
Publisher
John Wiley and Sons
Year
1996
Tongue
English
Weight
625 KB
Volume
42
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

✦ Synopsis


Abstract

We refine the definition of II‐computability of [12] so that oracles have a “consistent”, but natural, behaviour. We prove a Kleene Normal Form Theorem and closure of semi‐recursive relations under ∃^1^. We also show that in this more inclusive computation theory Post's theorem in the arithmetical hierarchy still holds.

Mathematics Subject Classification: 03D65, 03D75.