Recursive labelling systems and stability of recursive structures in hyperarithmetical degrees
暂无分享,去创建一个
We show that, under certain assumptions of recursiveness in 2t, the recursive structure 2t is AO-stable for ca w, we need to deal with limit ordinals, and we frame an analogous result [Proposition 2] for (-yn)-systems where (-yn) is an increasing sequence of ordinals. Propositions 1 and 2 are then established by the
[1] Jon Barwise,et al. Admissible sets and structures , 1975 .
[2] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .
[3] Christopher J. Ash. Stability of recursive structures in arithmetical degrees , 1986, Ann. Pure Appl. Log..
[4] S. S. Goncharov,et al. The quantity of nonautoequivalent constructivizations , 1977 .