Interpolating d-r.e. and REA degrees between r.e. degrees

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Refining membership degrees obtained from fuzzy C-means by re-fuzzification

Fuzzy C-mean (FCM) is the most well-known and widely-used fuzzy clustering algorithm. However, one of the weaknesses of the FCM is the way it assigns membership degrees to data which is based on the distance to the cluster centers. Unfortunately, the membership degrees are determined without considering the shape and density of the clusters. In this paper, we propose an algorithm which takes th...

متن کامل

A SPLITTING THEOREM FOR n−REA DEGREES

We prove that, for any D, A and U with D >T A ⊕ U and r.e. in A⊕ U , there are pairs X0, X1 and Y0, Y1 such that D ≡T X0 ⊕X1; D ≡T Y0 ⊕ Y1; and, for any i and j from {0, 1} and any set B, if Xi ⊕A ≥T B and Yj ⊕ A ≥T B then A ≥T B. We then deduce that for any degrees d, a, and b such that a and b are recursive in d, a 6≥T b, and d is n − REA in a, d can be split over a avoiding b. This shows tha...

متن کامل

s-Degrees within e-Degrees

For any enumeration degree a let D a be the set of s-degrees contained in a. We answer an open question of Watson by showing that if a is a nontrivial Σ2-enumeration degree, then D a has no least element. We also show that every countable partial order embeds into D a.

متن کامل

I classes, LR degrees and Turing degrees

We say that A ≤LR B if every B-random set is A-random with respect to Martin-Löf randomness. We study this reducibility and its interactions with the Turing reducibility, Π1 classes, hyperimmunity and other recursion theoretic notions. A natural variant of the Turing reducibility from the point of view of Martin-Löf randomness is the LR reducibility which was introduced in [12]. We say that A ≤...

متن کامل

Degrees of Efficiency and Degrees of Minimality

In this work we characterize different types of solutions of a vector optimization problem by means of a scalarization procedure. Usually different scalarizing functions are used in order to obtain the various solutions of the vector problem. Here we consider different kinds of solutions of the same scalarized problem. Our results allow us to establish a parallelism between the solutions of the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Pure and Applied Logic

سال: 1996

ISSN: 0168-0072

DOI: 10.1016/0168-0072(96)00014-0