Reflection and forcing in E-recursion theory
type: Item
instance of: scholarly article
title: Reflection and forcing in E-recursion theory
zbMATH Open document ID: 0574.03034
DOI: 10.1016/0168-0072(85)90036-3
author: Theodore A. Slaman
published in: Annals of Pure and Applied Logic
publication date: 1985-01-01T00:00:00Z
review text: E-recursive enumerability is compared via forcing to \(\Sigma_ 1\) definability. It is shown that for every countable E-closed ordinal \(\kappa\) there is a set of reals, X, so that \(L_{\kappa}[X]\) is the least E-closed structure over X.
Mathematics Subject Classification ID: 03D65
Mathematics Subject Classification ID: 03E40
Mathematics Subject Classification ID: 03E45
zbMATH DE Number: 3916253
zbMATH Keywords: definability
MaRDI profile type: Publication
full work available at URL: 0168-0072(85)90036-3
OpenAlex ID: W1968293668
cites work: Effective cofinalities and admissibility in E-recursion
cites work: Plus‐1 Results for E‐Recursion
cites work: Recursive Functionals and Quantifiers of Finite Types I
cites work: Recursive Functionals and Quantifiers of Finite Types II
cites work: Hyperanalytic Predicates
cites work: Q4773693
cites work: Countable admissible ordinals and hyperdegrees
cites work: The K-Section of a Type n Object
cites work: Q3922663
cites work: The limits of E-recursive enumerability
cites work: Inadmissible forcing
description: scientific article; zbMATH DE number 3916253