The limits of E-recursive enumerability

A classical result of Kleene is: \(2^{\omega}\cap HYP\) is recursively enumerable in \({}^ 2E\). Restated in E-recursion theory, it says: \(2^{\omega}\cap E(\omega)\) is E-recursively enumerable in \(\omega\). Forcing, compactness and fine structure techniques decide various possible extensions of Kleene's result. Suppose L(\(\kappa)\) is E-closed but not \(\Sigma_ 1\) admissible. Let cf and gc denote cofinality and greatest cardinal in the sense of L(\(\kappa)\). Then (i)\(\leftrightarrow (ii)\). (i) \(2^{gc(\kappa)}\cap L(\kappa)\) is E-recursively enumerable in some \(a\in L(\kappa)\). (ii) \(\omega <cf(gc(\kappa))<gc(\kappa)\); or \(cf(gc(\kappa))=\omega\) and every amenable subset of gc(\(\kappa)\) belongs to L(\(\kappa)\). Thus (i) fails if gc(\(\kappa)\) is regular (in L(\(\kappa)\)), or if \(cf(gc(\kappa))=\omega\) and \(\kappa\) is countable.

Recommendations

Cites work

Cited in

(11)

This page was built for publication: The limits of E-recursive enumerability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1095136)