Proof of a theorem of Sacks

スポンサーリンク

概要

• 論文の詳細を見る

• In [1], Sacks has proved that the recursively enumerable degrees are dense. The purpose of this paper is to give a simple proof of the above theorem, by a slight modification of a method used in [2]. The method used in our proof is applicable to a theorem presented by Hirose [3]. By a straight extension of our method, the corresponding theorems in metarecursion theory (Cf. [6], [7], [8]) are proved, as it will be given in a future paper.

• 明治大学の論文

著者

• 大橋 健八郎

  School Of Science And Technology Meiji University

• 大橋 健八郎

  明治大学

関連論文

• Fuzzy logicとNonstandard Analysis
• Fuzzy Set TheoryとUltraproduct
• Relative recursivenessについて(科学技術研究所年報第9号)
• Proof of a theorem of Sacks
• Recursively enumerble degreesについて(科学技術研究所年報第8号)
• recursion, metarecursion,および分解について
• Recursively enumerable degreesについて

スポンサーリンク