A noninitial segment of index sets

1974 ◽  
Vol 39 (2) ◽  
pp. 209-224 ◽  
Author(s):  
Louise Hay
Keyword(s):  
Partial Order ◽  
Initial Segment ◽  
Finite Sets ◽  
Index Set ◽  
Difference Hierarchy ◽  
Recursively Enumerable ◽  
Index Sets ◽  
The Difference ◽  
The One ◽  
Standard Enumeration

Let {Wk}k ≥ 0 be a standard enumeration of all recursively enumerable (r.e.) sets. If A is any class of r.e. sets, let θA denote the index set of A, i.e., θA = {k ∣ Wk ∈ A}. The one-one degrees of index sets form a partial order ℐ which is a proper subordering of the partial order of all one-one degrees. Denote by ⌀ the one-one degree of the empty set, and, if b is the one-one degree of θB, denote by the one-one degree of . Let . Let {Ym}m≥0 be the sequence of index sets of nonempty finite classes of finite sets (classified in [5] and independently, in [2]) and denote by am the one-one degree of Ym. As shown in [2], these degrees are complete at each level of the difference hierarchy generated by the r.e. sets. It was proved in [3] that, for each m ≥ 0,(a) am+1 and ām+1 are incomparable immediate successors of am and ām, and(b) .For m = 0, since Y0 = θ{⌀}, it follows from (a) that(c) .Hence it follows that(d) {⌀, , ao, ā0, a1, ā1 is an initial segment of ℐ.

Classifications of generalized index sets of open classes

1978 ◽  
Vol 43 (4) ◽  
pp. 694-714 ◽  
Author(s):  
Nancy Johnson
Keyword(s):  
Finite Collection ◽  
Finite Sets ◽  
Index Set ◽  
Recursively Enumerable ◽  
Ershov Hierarchy ◽  
Index Sets ◽  
Finite Set ◽  
The Difference ◽  
Original Classification

The Rice-Shapiro Theorem [4] says that the index set of a class of recursively enumerable (r.e.) sets is r.e. if and only if consists of all sets which extend an element of a canonically enumerable sequence of finite sets. If an index of a difference of r.e. (d.r.e.) sets is defined to be the pair of indices of the r.e. sets of which it is the difference, then the following generalization due to Hay [3] is obtained: The index set of a class of d.r.e. sets is d.r.e. if and only if is empty or consists of all sets which extend a single fixed finite set. In that paper Hay also classifies index sets of classes consisting of d.r.e. sets which extend one of a finite collection of finite sets. These sets turn out to be finite Boolean combinations of r.e. sets. The question then arises “What about the classification of the index set of a class consisting of d.r.e. sets which extend an element of a canonically enumerable sequence of finite sets?” The results in this paper come from an attempt to answer this question.Since classes of sets which are Boolean combinations of r.e. sets form a hierarchy (the finite Ershov hierarchy, see Ershov [1]) with the r.e. and d.r.e. sets respectively levels 1 and 2 of this hierarchy, we may define index sets of classes of level n sets. If is a class of level n sets which extend some element of a canonically enumerable sequence of finite sets and if we let co-, then we extend the original classification question to the classification of the index sets of the classes and co-.Now if the sequence of finite sets enumerates only finitely many sets or if only finitely many of the finite sets are minimal under inclusion, then it is a routine computation to verify that the index sets of and co- are in the finite Ershov hierarchy. Thus we are interested in the case in which infinitely many of the sequence of finite sets are minimal under inclusion. However if the infinite sequence is fairly simple, for instance{0}, {1}, {2}, … then the r.e. index set of co- is Σ20-complete as well as the index sets of and co- for all levels n > 2. Since the finite Ershov hierarchy does not exhaust ⊿20 there is a lot of “room” between these two extreme cases.

A discrete chain of degrees of index sets

1972 ◽  
Vol 37 (1) ◽  
pp. 139-149 ◽  
Author(s):  
Louise Hay
Keyword(s):  
Lower Bound ◽  
Upper Bound ◽  
Local Information ◽  
Truth Table ◽  
Partial Ordering ◽  
Index Set ◽  
Recursively Enumerable ◽  
Index Sets ◽  
The One ◽  
Standard Enumeration

Let {Wi} be a standard enumeration of all recursively enumerable (r.e.) sets, and for any class A of r.e. sets, let θA denote the index set of A = {n ∣ Wn ∈ A}. (Clearly, .) In [1], the index sets of nonempty finite classes of finite sets were classified under one-one reducibility into an increasing sequence {Ym}, 0 ≤ m < ∞. In this paper we examine further properties of this sequence within the partial ordering of one-one degrees of index sets. The main results are as follows: (1) For each m, Ym < Ym + 1 and < Ym + 1; (2) Ym is incomparable to ; (3) Ym + 1 and ; are immediate successors (among index sets) of Ym and m; (4) the pair (Ym + 1, ) is a “least upper bound” for the pair (Ym, ) in the sense that any successor of both Ym and is ≥ Ym + 1or; (5) the pair (Ym, ) is a “greatest lower bound” for the pair (Ym + 1, ) in the sense that any predecessor of both Ym + 1 and is ≤ Ym or . Since and all Ym are in the bounded truth-table degree of K, this yields some local information about the one-one degrees of index sets which are “at the bottom” in the one-one ordering of index sets.

Rice Theorems for ∑n-1 Sets

1977 ◽  
Vol 29 (4) ◽  
pp. 794-805 ◽  
Author(s):  
Nancy Johnson
Keyword(s):  
Finite Sets ◽  
Index Set ◽  
Recursively Enumerable ◽  
Recursively Enumerable Sets ◽  
The Difference

In [3] Hay proves generalizations of Rice's Theorem and the Rice-Shapiro Theorem for differences of recursively enumerable sets (d.r.e. sets). The original Rice Theorem [5, p. 3G4, Corollary B] says that the index set of a class C of r.e. sets is recursive if and only if C is empty or C contains all r.e. sets. The Rice-Shapiro Theorem conjectured by Rice [5] and proved independently by McNaughton, Shapiro, and Myhill [4] says that the index set of a class C of r.e. sets is r.e. if and only if C is empty or C consists of all r.e. sets which extend some element of a canonically enumerable class of finite sets. Since a d.r.e. set is a difference of r.e. sets, a d.r.e. set has an index associated with it, namely, the pair of indices of the r.e. sets of which it is the difference.

Index sets of finite classes of recursively enumerable sets

1969 ◽  
Vol 34 (1) ◽  
pp. 39-44 ◽  
Author(s):  
Louise Hay
Keyword(s):  
Index Set ◽  
Recursive Functions ◽  
Recursively Enumerable ◽  
Index Sets ◽  
Recursively Enumerable Sets ◽  
Partial Recursive Functions ◽  
Recursive Isomorphism ◽  
Standard Enumeration

Let q0, q1,… be a standard enumeration of all partial recursive functions of one variable. For each i, let wi = range qi and for any recursively enumerable (r.e.) set α, let θα = {n | wn = α}. If A is a class of r.e. sets, let θA = the index set of A = {n | wn ∈ A}. It is the purpose of this paper to classify the possible recursive isomorphism types of index sets of finite classes of r.e. sets. The main theorem will also provide an answer to the question left open in [2] concerning the possible double isomorphism types of pairs (θα, θβ) where α ⊂ β.

Rice Theorems For D.R.E. Sets

1975 ◽  
Vol 27 (2) ◽  
pp. 352-365 ◽  
Author(s):  
Louise Hay
Keyword(s):  
Finite Sets ◽  
Index Set ◽  
Recursively Enumerable ◽  
Index Sets

Two of the basic theorems in the classification of index sets of classes of recursively enumerable (r.e.) sets are the following:(i) The index set of a class C of r.e. sets is recursive if and only if C is empty or contains all r.e. sets; and(ii) the index set of a class C or r.e. sets is recursively enumerable if and only if C is empty or consists of all r.e. sets which extend some element of a canonically enumerable class of finite sets.The first theorem is due to Rice [7, p. 364, Corollary B]. The second was conjectured by Rice [7, p. 361] and proved independently by McNaughton, Shapiro, and Myhill [6].

Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers

1984 ◽  
Vol 49 (4) ◽  
pp. 1205-1236 ◽  
Author(s):  
Carl G. Jockusch ◽  
Richard A. Shore
Keyword(s):  
Natural Class ◽  
Difference Hierarchy ◽  
Recursively Enumerable ◽  
The Difference ◽  
Hyperarithmetic Hierarchy ◽  
The Way

In this paper we introduce a new hierarchy of sets and operators which we call the REA hierarchy for “recursively enumerable in and above”. The hierarchy is generated by composing (possibly) transfinite sequences of the pseudo-jump operators considered in Jockusch and Shore [1983]. We there studied pseudo-jump operators defined by analogy with the Turing jump as ones taking a set A to A ⊕ for some index e. We would now call these 1-REA operators and will extend them to α-REA operators for recursive ordinals α in analogy with the iterated Turing jump operators (A → A(α) for α < and Kleene's hyperarithmetic hierarchy. The REA sets will then, of course, be the results of applying these operators to the empty set. They will extend and generalize Kleene's H sets but will still be contained in the class of set singletons thus providing us with a new richer subclass of the set singletons which, as we shall see, is related to the work of Harrington [1975] and [1976] on the problems of Friedman [1975] about the arithmetic degrees of such singletons. Their degrees also give a natural class extending the class H of Jockusch and McLaughlin [1969] by closing it off under transfinite iterations as well as the inclusion of [d, d′] for each degree d in the class. The reason for the class being closed under this last operation is that the REA operators include all operators and so give a new hierarchy for them as well as the sets. This hierarchy also turns out to be related to the difference hierarchy of Ershov [1968], [1968a] and [1970]: every α-r.e. set is α-REA but each level of the REA hierarchy after the first extends all the way through the difference hierarchy although never entirely encompassing even the next level of the difference hierarchy.

Kleene index sets and functional m-degrees

1983 ◽  
Vol 48 (3) ◽  
pp. 829-840 ◽  
Author(s):  
Jeanleah Mohrherr
Keyword(s):  
Partial Order ◽  
Turing Degree ◽  
Index Set ◽  
Natural Embedding ◽  
Recursive Functions ◽  
Index Sets ◽  
Partial Recursive Functions

AbstractA many-one degree is functional if it contains the index set of some class of partial recursive functions but does not contain an index set of a class of r.e. sets. We give a natural embedding of the r.e. m-degrees into the functional degrees of 0′. There are many functional degrees in 0′ in the sense that every partial-order can be embedded. By generalizing, we show there are many functional degrees in every complete Turing degree.There is a natural tie between the studies of index sets and partial-many-one reducibility. Every partial-many-one degree contains one or two index sets.

Use of a Lyophilized Reference Plasma to Compare Coagulation Test Procedures

1975 ◽  
Vol 34 (02) ◽  
pp. 426-444 ◽  
Author(s):  
J Kahan ◽  
I Nohén
Keyword(s):  
Oral Anticoagulant Therapy ◽  
Repeated Measurements ◽  
Test Procedures ◽  
Coagulation Activity ◽  
Close Relationship ◽  
Measured Activity ◽  
Test Materials ◽  
The Difference ◽  
The Stability ◽  
The One

SummaryIn 4 collaborative trials, involving a varying number of hospital laboratories in the Stockholm area, the coagulation activity of different test materials was estimated with the one-stage prothrombin tests routinely used in the laboratories, viz. Normotest, Simplastin-A and Thrombotest. The test materials included different batches of a lyophilized reference plasma, deep-frozen specimens of diluted and undiluted normal plasmas, and fresh and deep-frozen specimens from patients on long-term oral anticoagulant therapy.Although a close relationship was found between different methods, Simplastin-A gave consistently lower values than Normotest, the difference being proportional to the estimated activity. The discrepancy was of about the same magnitude on all the test materials, and was probably due to a divergence between the manufacturers’ procedures used to set “normal percentage activity”, as well as to a varying ratio of measured activity to plasma concentration. The extent of discrepancy may vary with the batch-to-batch variation of thromboplastin reagents.The close agreement between results obtained on different test materials suggests that the investigated reference plasma could be used to calibrate the examined thromboplastin reagents, and to compare the degree of hypocoagulability estimated by the examined PIVKA-insensitive thromboplastin reagents.The assigned coagulation activity of different batches of the reference plasma agreed closely with experimentally obtained values. The stability of supplied batches was satisfactory as judged from the reproducibility of repeated measurements. The variability of test procedures was approximately the same on different test materials.

The Demand For Money in Pakistan: Reply (Notes and Comments)

1975 ◽  
Vol 14 (3) ◽  
pp. 370-375
Author(s):  
M. A. Akhtar
Keyword(s):  
Interest Rates ◽  
Money Demand ◽  
Strong Support ◽  
Physical Capital ◽  
Careful Examination ◽  
Demand For Money ◽  
Weak Support ◽  
Complementarity Hypothesis ◽  
The Difference ◽  
The One

I am grateful to Abe, Fry, Min, Vongvipanond, and Yu (hereafter re¬ferred to as AFMVY) [1] for obliging me to reconsider my article [2] on the demand for money in Pakistan. Upon careful examination, I find that the AFMVY results are, in parts, misleading and that, on the whole, they add very little to those provided in my study. Nevertheless, the present exercise as well as the one by AFMVY is useful in that it furnishes us with an opportunity to view some of the fundamental problems involved in an empi¬rical analysis of the demand for money function in Pakistan. Based on their elaborate critique, AFMVY reformulate the two hypo¬theses—the substitution hypothesis and the complementarity hypothesis— underlying my study and provide us with some alternative estimates of the demand for money in Pakistan. Briefly their results, like those in my study, indicate that income and interest rates are important in deter¬mining the demand for money. However, unlike my results, they also suggest that the price variable is a highly significant determinant of the money demand function. Furthermore, while I found only a weak support for the complementarity between money demand and physical capital, the results obtained by AFMVY appear to yield a strong support for that rela¬tionship.1 The difference in results is only a natural consequence of alter¬native specifications of the theory and, therefore, I propose to devote most of this reply to the criticisms raised by AFMVY and the resulting reformulation of the two mypotheses.

Effect of leakage and blockage on the acoustic behavior of particle filters

2019 ◽  
Vol 67 (6) ◽  
pp. 483-492
Author(s):  
Seonghyeon Baek ◽  
Iljae Lee
Keyword(s):  
Transfer Matrix ◽  
Particle Filters ◽  
Acoustic Analysis ◽  
Transmission Loss ◽  
One Dimensional ◽  
Filter System ◽  
The Difference ◽  
The One ◽  
Analytical Approaches ◽  
Good Agreement

The effects of leakage and blockage on the acoustic performance of particle filters have been examined by using one-dimensional acoustic analysis and experimental methods. First, the transfer matrix of a filter system connected to inlet and outlet pipes with conical sections is measured using a two-load method. Then, the transfer matrix of a particle filter only is extracted from the experiments by applying inverse matrices of the conical sections. In the analytical approaches, the one-dimensional acoustic model for the leakage between the filter and the housing is developed. The predicted transmission loss shows a good agreement with the experimental results. Compared to the baseline, the leakage between the filter and housing increases transmission loss at a certain frequency and its harmonics. In addition, the transmission loss for the system with a partially blocked filter is measured. The blockage of the filter also increases the transmission loss at higher frequencies. For the simplicity of experiments to identify the leakage and blockage, the reflection coefficients at the inlet of the filter system have been measured using two different downstream conditions: open pipe and highly absorptive terminations. The experiments show that with highly absorptive terminations, it is easier to see the difference between the baseline and the defects.

Sign in / Sign up

Export Citation Format

Share Document