Bounded existential induction

1985 ◽  
Vol 50 (1) ◽  
pp. 72-90 ◽  
Author(s):  
George Wilmers

The present work may perhaps be seen as a point of convergence of two historically distinct sequences of results. One sequence of results started with the work of Tennenbaum [59] who showed that there could be no nonstandard recursive model of the system PA of first order Peano arithmetic. Shepherdson [65] on the other hand showed that the system of arithmetic with open induction was sufficiently weak to allow the construction of nonstandard recursive models. Between these two results there remained for many years a large gap occasioned by a general lack of interest in weak systems of arithmetic. However Dana Scott observed that the addition alone of a nonstandard model of PA could not be recursive, while more recently McAloon [82] improved these results by showing that even for the weaker system of arithmetic with only bounded induction, neither the addition nor the multiplication of a nonstandard model could be recursive.Another sequence of results starts with the work of Lessan [78], and independently Jensen and Ehrenfeucht [76], who showed that the structures which may be obtained as the reducts to addition of countable nonstandard models of PA are exactly the countable recursively saturated models of Presburger arithmetic. More recently, Cegielski, McAloon and the author [81] showed that the above result holds true if PA is replaced by the much weaker system of bounded induction.However in both the case of the Tennenbaum phenomenon and in that of the recursive saturation of addition the problem remained open as to how strong a system was really necessary to generate the required phenomenon. All that was clear a priori was that open induction was too weak to produce either result.

1989 ◽  
Vol 54 (1) ◽  
pp. 177-189 ◽  
Author(s):  
Roman Kossak

In [KP] we have studied the problem of determining when a subset of a (countable) model M of PA can be coded in an elementary end extension of M. Sets with this property are called elementary extensional. In particular we can ask whether there are elementary extensional subsets of a model which have order type ω. It turns out that having elementary extensional subsets of order type ω is an interesting property connected with other structural properties of models of PA. We will call this property the ω-property. In [KP] the problem of characterizing models with the ω-property was left open. It is still open, and the aim of this paper is to present a collection of results pertaining to it. It should be mentioned that the same notion was studied by Kaufmann and Schmerl in [KS2] in connection with some weak notions of saturation which they discuss there. Our notion of a model with the ω-property corresponds to the notion of an upward monotonically ω-lofty cut.It is fairly easy to see that countable recursively saturated models (or in fact all recursively saturated models with cofinality ω) and all short recursively saturated models have the ω-property (Proposition 1.2 below). On the other hand, if we had asked the question about the existence of models with the ω-property before 1975 (when recursively saturated models were introduced) the answer would probably not have been that easy and we would have to come to notions close to recursive saturation.


1983 ◽  
Vol 48 (3) ◽  
pp. 623-628 ◽  
Author(s):  
Julia F. Knight

In [6], Nadel showed that if is a recursively saturated model of Pr = Th(ω, +) of power at most ℵ1, then there is a model such that ≡ ∞ω and can be expanded to a recursively saturated model of P. For a fixed completion T of P, can be chosen to have a recursively saturated expansion to a model of T just in case is recursive in T-saturated. (“Recursive in T-saturation” is defined just like recursive saturation except that the sets of formulas considered are those that are recursive in T.)Nadel also showed in [6] that for a fixed completion T of P, a countable nonstandard model of Pr can be expanded to a model of T (not necessarily recursively saturated) iff satisfies a condition called “exp(T)-saturation.” This condition is stronger than recursive saturation but weaker than recursive in T-saturation. Nadel left open the problem of characterizing the models of Pr of power ℵ1 such that for some , ≣ ∞ω and can be expanded to a model of T. The present paper gives such a characterization. The condition on is that it is recursively saturated, and for each n ∈ ω, the set Tn of Πn-sentences of T is recursive in some type realized in .This result can be interpreted in various ways, just as the results from [6] were interpreted in various ways in [4]. Friedman [2] introduced the notion of a “standard system.”


1981 ◽  
Vol 24 (3) ◽  
pp. 295-297 ◽  
Author(s):  
A. H. Lachlan

AbstractIt is shown that a nonstandard model of Peano arithmetic which has a full satisfaction class is necessarily recursively saturated.


1982 ◽  
Vol 47 (3) ◽  
pp. 587-604 ◽  
Author(s):  
Julia Knight ◽  
Mark Nadel

If is a countable recursively saturated structure and T is a recursively axiomatizable theory that is consistent with Th(), then it is well known that can be expanded to a recursively saturated model of T [7, p. 186]. This is what has made recursively saturated models useful in model theory. Recursive saturation is the weakest notion of saturation for which this expandability result holds. In fact, if is a countable model of Pr = Th(ω, +), then can be expanded to a model of first order Peano arithmetic P just in case is recursively saturated (see [3]).In this paper we investigate two natural sets of Turing degrees that tell a good deal about the expandability of a given structure. If is a recursively saturated structure, I() consists of the degrees of sets that are recursive in complete types realized in . The second set of degrees, D(), consists of the degrees of sets S such that is recursive in S-saturated. In general, I() ⊆ D(). Moreover, I() is obviously an “ideal” of degrees. For countable structures , D() is “closed” in the following sense: For any class C ⊆ 2ω, if C is co-r.e. in S for some set S such that , then there is some σ ∈ C such that . For uncountable structures , we do not know whether D() must be closed.


Geosciences ◽  
2020 ◽  
Vol 10 (9) ◽  
pp. 329
Author(s):  
Mahdi O. Karkush ◽  
Mahmood D. Ahmed ◽  
Ammar Abdul-Hassan Sheikha ◽  
Ayad Al-Rumaithi

The current study involves placing 135 boreholes drilled to a depth of 10 m below the existing ground level. Three standard penetration tests (SPT) are performed at depths of 1.5, 6, and 9.5 m for each borehole. To produce thematic maps with coordinates and depths for the bearing capacity variation of the soil, a numerical analysis was conducted using MATLAB software. Despite several-order interpolation polynomials being used to estimate the bearing capacity of soil, the first-order polynomial was the best among the other trials due to its simplicity and fast calculations. Additionally, the root mean squared error (RMSE) was almost the same for the all of the tried models. The results of the study can be summarized by the production of thematic maps showing the variation of the bearing capacity of the soil over the whole area of Al-Basrah city correlated with several depths. The bearing capacity of soil obtained from the suggested first-order polynomial matches well with those calculated from the results of SPTs with a deviation of ±30% at a 95% confidence interval.


1995 ◽  
Vol 74 (6) ◽  
pp. 2665-2684 ◽  
Author(s):  
Y. Kondoh ◽  
Y. Hasegawa ◽  
J. Okuma ◽  
F. Takahashi

1. A computational model accounting for motion detection in the fly was examined by comparing responses in motion-sensitive horizontal system (HS) and centrifugal horizontal (CH) cells in the fly's lobula plate with a computer simulation implemented on a motion detector of the correlation type, the Reichardt detector. First-order (linear) and second-order (quadratic nonlinear) Wiener kernels from intracellularly recorded responses to moving patterns were computed by cross correlating with the time-dependent position of the stimulus, and were used to characterize response to motion in those cells. 2. When the fly was stimulated with moving vertical stripes with a spatial wavelength of 5-40 degrees, the HS and CH cells showed basically a biphasic first-order kernel, having an initial depolarization that was followed by hyperpolarization. The linear model matched well with the actual response, with a mean square error of 27% at best, indicating that the linear component comprises a major part of responses in these cells. The second-order nonlinearity was insignificant. When stimulated at a spatial wavelength of 2.5 degrees, the first-order kernel showed a significant decrease in amplitude, and was initially hyperpolarized; the second-order kernel was, on the other hand, well defined, having two hyperpolarizing valleys on the diagonal with two off-diagonal peaks. 3. The blockage of inhibitory interactions in the visual system by application of 10-4 M picrotoxin, however, evoked a nonlinear response that could be decomposed into the sum of the first-order (linear) and second-order (quadratic nonlinear) terms with a mean square error of 30-50%. The first-order term, comprising 10-20% of the picrotoxin-evoked response, is characterized by a differentiating first-order kernel. It thus codes the velocity of motion. The second-order term, comprising 30-40% of the response, is defined by a second-order kernel with two depolarizing peaks on the diagonal and two off-diagonal hyperpolarizing valleys, suggesting that the nonlinear component represents the power of motion. 4. Responses in the Reichardt detector, consisting of two mirror-image subunits with spatiotemporal low-pass filters followed by a multiplication stage, were computer simulated and then analyzed by the Wiener kernel method. The simulated responses were linearly related to the pattern velocity (with a mean square error of 13% for the linear model) and matched well with the observed responses in the HS and CH cells. After the multiplication stage, the linear component comprised 15-25% and the quadratic nonlinear component comprised 60-70% of the simulated response, which was similar to the picrotoxin-induced response in the HS cells. The quadratic nonlinear components were balanced between the right and left sides, and could be eliminated completely by their contralateral counterpart via a subtraction process. On the other hand, the linear component on one side was the mirror image of that on the other side, as expected from the kernel configurations. 5. These results suggest that responses to motion in the HS and CH cells depend on the multiplication process in which both the velocity and power components of motion are computed, and that a putative subtraction process selectively eliminates the nonlinear components but amplifies the linear component. The nonlinear component is directionally insensitive because of its quadratic non-linearity. Therefore the subtraction process allows the subsequent cells integrating motion (such as the HS cells) to tune the direction of motion more sharply.


2010 ◽  
Vol 2010 ◽  
pp. 1-39 ◽  
Author(s):  
Alessandro Morando ◽  
Paolo Secchi

We study the boundary value problem for a linear first-order partial differential system with characteristic boundary of constant multiplicity. We assume the problem to be “weakly” well posed, in the sense that a uniqueL2-solution exists, for sufficiently smooth data, and obeys an a priori energy estimate with a finite loss of tangential/conormal regularity. This is the case of problems that do not satisfy the uniform Kreiss-Lopatinskiĭ condition in the hyperbolic region of the frequency domain. Provided that the data are sufficiently smooth, we obtain the regularity of solutions, in the natural framework of weighted conormal Sobolev spaces.


Open Theology ◽  
2019 ◽  
Vol 5 (1) ◽  
pp. 430-450
Author(s):  
Kristóf Oltvai

Abstract Karl Barth’s and Jean-Luc Marion’s theories of revelation, though prominent and popular, are often criticized by both theologians and philosophers for effacing the human subject’s epistemic integrity. I argue here that, in fact, both Barth and Marion appeal to revelation in an attempt to respond to a tendency within philosophy to coerce thought. Philosophy, when it claims to be able to access a universal, absolute truth within history, degenerates into ideology. By making conceptually possible some ‚evental’ phenomena that always evade a priori epistemic conditions, Barth’s and Marion’s theories of revelation relativize all philosophical knowledge, rendering any ideological claim to absolute truth impossible. The difference between their two theories, then, lies in how they understand the relationship between philosophy and theology. For Barth, philosophy’s attempts to make itself absolute is a produce of sinful human vanity; its corrective is thus an authentic revealed theology, which Barth articulates in Christian, dogmatic terms. Marion, on the other hand, equipped with Heidegger’s critique of ontotheology, highlights one specific kind of philosophizing—metaphysics—as generative of ideology. To counter metaphysics, Marion draws heavily on Barth’s account of revelation but secularizes it, reinterpreting the ‚event’ as the saturated phenomenon. Revelation’s unpredictability is thus preserved within Marion’s philosophy, but is no longer restricted to the appearing of God. Both understandings of revelation achieve the same epistemological result, however. Reality can never be rendered transparent to thought; within history, all truth is provisional. A concept of revelation drawn originally from Christian theology thus, counterintuitively, is what secures philosophy’s right to challenge and critique the pre-given, a hermeneutic freedom I suggest is the meaning of sola scriptura.


1991 ◽  
Vol 274 (2) ◽  
pp. 581-585 ◽  
Author(s):  
S C Kivatinitz ◽  
A Miglio ◽  
R Ghidoni

The fate of exogenous ganglioside GM1 labelled in the sphingosine moiety, [Sph-3H]GM1, administered as a pulse, in the isolated perfused rat liver was investigated. When a non-recirculating protocol was employed, the amount of radioactivity in the liver and perfusates was found to be dependent on the presence of BSA in the perfusion liquid and on the time elapsed after the administration of the ganglioside. When BSA was added to the perfusion liquid, less radioactivity was found in the liver and more in the perfusate at each time tested, for up to 1 h. The recovery of radioactivity in the perfusates followed a complex course which can be described by three pseudo-first-order kinetic constants. The constants, in order of decreasing velocity, are interpreted as: (a) the dilution of the labelled GM1 by the constant influx of perfusion liquid; (b) the washing off of GM1 loosely bound to the surface of liver cells; (c) the release of gangliosides from the liver. Process (b) was found to be faster in the presence of BSA, probably owing to the ability of BSA to bind gangliosides. The [Sph-3H]GM1 in the liver underwent metabolism, leading to the appearance of products of anabolic (GD1a, GD1b) and catabolic (GM2, GM3) origin; GD1a appeared before GM2 and GM3 but, at times longer than 10 min, GM2 and GM3 showed more radioactivity than GD1a. At a given time the distribution of the radioactivity in the perfusates was quite different from that of the liver. In fact, after 60 min GD1a was the only metabolite present in any amount, the other being GM3, the quantity of which was small. This indicates that the liver is able to release newly synthesized gangliosides quite specifically. When a recirculating protocol was used, there were more catabolites and less GD1a than with the non-recirculating protocol. A possible regulatory role of ganglioside re-internalization on their own metabolism in the liver is postulated.


2020 ◽  
Vol 28 (3) ◽  
pp. 449-463 ◽  
Author(s):  
Natalia P. Bondarenko ◽  
Chung-Tsun Shieh

AbstractIn this paper, partial inverse problems for the quadratic pencil of Sturm–Liouville operators on a graph with a loop are studied. These problems consist in recovering the pencil coefficients on one edge of the graph (a boundary edge or the loop) from spectral characteristics, while the coefficients on the other edges are known a priori. We obtain uniqueness theorems and constructive solutions for partial inverse problems.


Sign in / Sign up

Export Citation Format

Share Document