Minimal α-recursion theoretic degrees

1973 ◽  
Vol 38 (1) ◽  
pp. 18-28 ◽  
Author(s):  
John M. MacIntyre

This paper investigates the problem of extending the recursion theoretic construction of a minimal degree to the Kripke [2]-Platek [5] recursion theory on the ordinals less than an admissible ordinal α, a theory derived from the Takeuti [11] notion of a recursive function on the ordinal numbers. As noted in Sacks [7] when one generalizes the recursion theoretic definition of relative recursiveness to α-recursion theory for α > ω the two usual definitions give rise to two different notions of reducibility. We will show that whenever α is either a countable admissible or a regular cardinal of the constructible universe there is a subset of α whose degree is minimal for both notions of reducibility. The result is an excellent example of a theorem of ordinary recursion theory obtainable via two different constructions, one of which generalizes, the other of which does not. The construction which cannot be lifted to α-recursion theory is that of Spector [10]. We sketch the reasons for this in §3.

1974 ◽  
Vol 39 (2) ◽  
pp. 295-304 ◽  
Author(s):  
Richard A. Shore

In this paper we will present an application of generalized recursion theory to (noncombinatorial) set theory. More precisely we will combine a priority argument in α-recursion theory with a forcing construction to prove a theorem about the interdefinability of certain subsets of admissible ordinals.Our investigation was prompted by G. Sacks and S. Simpson asking [6] if it is obvious that there are, for each Σn-admissible α, Σn (over Lα) subsets of α which are Δn-incomparable. If one understands “B is Δn in C” to mean that there are Σn/Lα reduction procedures which put out B and when one feeds in C, then the answer is an unqualified “yes.” In this sense “Δn in” is a direct generalization of “α-recursive in” (replace Σ1 by Σn in the definition) and so amenable to the methods of [7, §§3, 5]. Indeed one simply chooses a complete Σn−1 set A and mimics the construction of [6] as modified in [7, §5] to produce two α-A-r.e. sets B and C neither of which is α-A-recursive in the other. By the remarks on translation [7, §3] this will immediately give the desired result for this definition of “Δn in.”There is, however, the more obvious and natural notion of “Δn in” to be considered: B is Δn in C iff there are Σn and Πn formulas of ⟨Lα, C⟩ which define B.


Author(s):  
K. T. Tokuyasu

During the past investigations of immunoferritin localization of intracellular antigens in ultrathin frozen sections, we found that the degree of negative staining required to delineate u1trastructural details was often too dense for the recognition of ferritin particles. The quality of positive staining of ultrathin frozen sections, on the other hand, has generally been far inferior to that attainable in conventional plastic embedded sections, particularly in the definition of membranes. As we discussed before, a main cause of this difficulty seemed to be the vulnerability of frozen sections to the damaging effects of air-water surface tension at the time of drying of the sections.Indeed, we found that the quality of positive staining is greatly improved when positively stained frozen sections are protected against the effects of surface tension by embedding them in thin layers of mechanically stable materials at the time of drying (unpublished).


Author(s):  
Juan de Lara ◽  
Esther Guerra

AbstractModelling is an essential activity in software engineering. It typically involves two meta-levels: one includes meta-models that describe modelling languages, and the other contains models built by instantiating those meta-models. Multi-level modelling generalizes this approach by allowing models to span an arbitrary number of meta-levels. A scenario that profits from multi-level modelling is the definition of language families that can be specialized (e.g., for different domains) by successive refinements at subsequent meta-levels, hence promoting language reuse. This enables an open set of variability options given by all possible specializations of the language family. However, multi-level modelling lacks the ability to express closed variability regarding the availability of language primitives or the possibility to opt between alternative primitive realizations. This limits the reuse opportunities of a language family. To improve this situation, we propose a novel combination of product lines with multi-level modelling to cover both open and closed variability. Our proposal is backed by a formal theory that guarantees correctness, enables top-down and bottom-up language variability design, and is implemented atop the MetaDepth multi-level modelling tool.


2020 ◽  
Vol 26 (3-4) ◽  
pp. 268-286
Author(s):  
YONG CHENG

AbstractIn this paper, we examine the limit of applicability of Gödel’s first incompleteness theorem ($\textsf {G1}$ for short). We first define the notion “$\textsf {G1}$ holds for the theory $T$”. This paper is motivated by the following question: can we find a theory with a minimal degree of interpretation for which $\textsf {G1}$ holds. To approach this question, we first examine the following question: is there a theory T such that Robinson’s $\mathbf {R}$ interprets T but T does not interpret $\mathbf {R}$ (i.e., T is weaker than $\mathbf {R}$ w.r.t. interpretation) and $\textsf {G1}$ holds for T? In this paper, we show that there are many such theories based on Jeřábek’s work using some model theory. We prove that for each recursively inseparable pair $\langle A,B\rangle $, we can construct a r.e. theory $U_{\langle A,B\rangle }$ such that $U_{\langle A,B\rangle }$ is weaker than $\mathbf {R}$ w.r.t. interpretation and $\textsf {G1}$ holds for $U_{\langle A,B\rangle }$. As a corollary, we answer a question from Albert Visser. Moreover, we prove that for any Turing degree $\mathbf {0}< \mathbf {d}<\mathbf {0}^{\prime }$, there is a theory T with Turing degree $\mathbf {d}$ such that $\textsf {G1}$ holds for T and T is weaker than $\mathbf {R}$ w.r.t. Turing reducibility. As a corollary, based on Shoenfield’s work using some recursion theory, we show that there is no theory with a minimal degree of Turing reducibility for which $\textsf {G1}$ holds.


2018 ◽  
Vol 6 (4) ◽  
pp. 401-428
Author(s):  
Miriam R. Lowi

Studies of identity and belonging in Gulf monarchies tend to privilege tribal or religious affiliation, if not the protective role of the ruler as paterfamilias. I focus instead on the ubiquitous foreigner and explore ways in which s/he contributes to the definition of national community in contemporary gcc states. Building upon and moving beyond the scholarly literature on imported labor in the Gulf, I suggest that the different ‘categories’ of foreigners impact identity and the consolidation of a community of privilege, in keeping with the national project of ruling families. Furthermore, I argue that the ‘European,’ the non-gcc Arab, and the predominantly Asian (and increasingly African) laborer play similar, but also distinct roles in the delineation of national community: while they are differentially incorporated in ways that protect the ‘nation’ and appease the citizen-subject, varying degrees of marginality reflect Gulf society’s perceptions or aspirations of the difference between itself and ‘the other(s).’


1962 ◽  
Vol 69 (5) ◽  
pp. 381-386 ◽  
Author(s):  
Maurice Sion ◽  
Richard Willmott

1972 ◽  
Vol 37 (4) ◽  
pp. 677-682 ◽  
Author(s):  
George Metakides

Let α be a limit ordinal with the property that any “recursive” function whose domain is a proper initial segment of α has its range bounded by α. α is then called admissible (in a sense to be made precise later) and a recursion theory can be developed on it (α-recursion theory) by providing the generalized notions of α-recursively enumerable, α-recursive and α-finite. Takeuti [12] was the first to study recursive functions of ordinals, the subject owing its further development to Kripke [7], Platek [8], Kreisel [6], and Sacks [9].Infinitary logic on the other hand (i.e., the study of languages which allow expressions of infinite length) was quite extensively studied by Scott [11], Tarski, Kreisel, Karp [5] and others. Kreisel suggested in the late '50's that these languages (even which allows countable expressions but only finite quantification) were too large and that one should only allow expressions which are, in some generalized sense, finite. This made the application of generalized recursion theory to the logic of infinitary languages appear natural. In 1967 Barwise [1] was the first to present a complete formalization of the restriction of to an admissible fragment (A a countable admissible set) and to prove that completeness and compactness hold for it. [2] is an excellent reference for a detailed exposition of admissible languages.


The vapour pressure theory regards osmotic pressure as the pressure required to produce equilibrium between the pure solvent and the solution. Pressure applied to a solution increases its internal vapour pressure. If the compressed solution be on one aide of a semi-permeable partition and the pure solvent on the other, there is osmotic equilibrium when the com-pression of the solution brings its vapour pressure to equality with that of the solvent. So long ago as 1894 Ramsay* found that with a partition of palladium, permeable to hydrogen but not to nitrogen, the hydrogen pressures on each side tended to equality, notwithstanding the presence of nitrogen under pressure on one side, which it might have been supposed would have resisted tin- transpiration of the hydrogen. The bearing of this experiment on the problem of osmotic pressure was recognised by van’t Hoff, who observes that "it is very instructive as regards the means by which osmotic pressure is produced." But it was not till 1908 that the vapour pressure theory of osmotic pressure was developed on a finu foundation by Calendar. He demonstrated, by the method of the "vapour sieve" piston, the proposition that “any two solutions in equilibrium through any kind of membrane or capillary surface must have the same vapour pressures in respect of each of their constituents which is capable of diffusing through their surface of separation"—a generalisation of great importance for the theory of solutions. Findlay, in his admirable monograph, gives a very complete account of the contending theories of osmotic pressure, a review of which leaves no doubt that at the present moment the vapour pressure theory stands without a serious rival Some confusion of ideas still arises from the want of adherence to a strict definition of osmotic pressure to which numerical data from experimental measurements should he reduced. Tire following definitions appear to be tire outcome of tire vapour pressure theory :— Definition I.—The vapour pressure of a solution is the pressure of the vapour with which it is in equilibrium when under pressure of its own vapour only.


1994 ◽  
Vol 4 (1) ◽  
pp. 181-198 ◽  
Author(s):  
Bijan Vahabzadeh

Euclid's definition of proportional magnitudes in the Fifth Book of the Elements gave rise to many commentaries. We examine closely two of these commentaries, one by al-Jayyānī (11th century) and the other by Saunderson (18th century). Both al-Jayyānī and Saunderson attempted to defend Euclid's definition by making explicit what Euclid had only implied. We show that the two authors explain Euclid's position in a virtually identical manner.


1984 ◽  
Vol 49 (1) ◽  
pp. 47-50 ◽  
Author(s):  
Frederic B. Fitch

In [3] a definition of negation was presented for the system K′ of extended basic logic [1], but it has since been shown by Peter Päppinghaus (personal communication) that this definition fails to give rise to the law of double negation as I claimed it did. The purpose of this note is to revise this defective definition in such a way that it clearly does give rise to the law of double negation, as well as to the other negation rules of K′.Although Päppinghaus's original letter to me was dated September 19, 1972, the matter has remained unresolved all this time. Only recently have I seen that there is a simple way to correct the definition. I am of course very grateful to Päppinghaus for pointing out my error in claiming to be able to derive the rule of double negation from the original form of the definition.The corrected definition will, as before, use fixed-point operators to give the effect of the required kind of transfinite induction, but this time a double transfinite induction will be used, somewhat like the double transfinite induction used in [5] to define simultaneously the theorems and antitheorems of system CΓ.


Sign in / Sign up

Export Citation Format

Share Document