scholarly journals The Computational Strength of Extensions of Weak König’s Lemma

1998 ◽  
Vol 5 (41) ◽  
Author(s):  
Ulrich Kohlenbach
Keyword(s):  
Natural Number ◽  
Arbitrary Function ◽  
The Other ◽  
Binary Trees ◽  
Subsequent Paper ◽  
Bounded Functions ◽  
The One ◽  
Weak König’S Lemma ◽  
König’S Lemma

The weak König's lemma WKL is of crucial significance in the study of fragments of mathematics which on the one hand are mathematically strong but on the other hand have a low proof-theoretic and computational strength. In addition to the restriction to binary trees (or equivalently bounded trees), WKL<br />is also `weak' in that the tree predicate is quantifier-free. Whereas in general the computational and proof-theoretic strength increases when logically more complex trees are allowed, we show that this is not the case for trees which are<br />given by formulas in a class Phi where we allow an arbitrary function quantifier prefix over bounded functions in front of a Pi^0_1-formula. This results in a schema Phi-WKL.<br />Another way of looking at WKL is via its equivalence to the principle<br /> For all x there exists y<=1 for all z A0(x; y; z) -> there exists f <= lambda x.1 for all x, z A0(x, fx, z);<br />where A0 is a quantifier-free formula (x, y, z are natural number variables). <br /> We generalize this to Phi-formulas as well and allow function quantifiers `there exists g <= s'<br />instead of `there exists y <= 1', where g <= s is defined pointwise. The resulting schema is called Phi-b-AC^0,1.<br />In the absence of functional parameters (so in particular in a second order context), the corresponding versions of Phi-WKL and Phi-b-AC^0,1 turn out to<br />be equivalent to WKL. This changes completely in the presence of functional<br />variables of type 2 where we get proper hierarchies of principles Phi_n-WKL and<br />Phi_n-b-AC^0,1. Variables of type 2 however are necessary for a direct representation<br />of analytical objects and - sometimes - for a faithful representation of<br />such objects at all as we will show in a subsequent paper. By a reduction of<br />Phi-WKL and Phi-b-AC^0,1 to a non-standard axiom F (introduced in a previous paper) and a new elimination result for F relative to various fragment of arithmetic in all finite types, we prove that Phi-WKL and Phi-b-AC^0,1 do<br />neither contribute to the provably recursive functionals of these fragments nor to their proof-theoretic strength. In a subsequent paper we will illustrate the greater mathematical strength of these principles (compared to WKL).

Relational problems are not fully solved by a temporal sequence of statistical learning episodes

1997 ◽  
Vol 20 (1) ◽  
pp. 82-82 ◽  
Author(s):  
A. Vinter ◽  
P. Perruchet
Keyword(s):  
Implicit Learning ◽  
Statistical Learning ◽  
Temporal Sequence ◽  
The Other ◽  
Learning Mechanisms ◽  
Learning Research ◽  
The One

Clark & Thornton's conception finds an echo in implicit learning research, which shows that subjects may perform adaptively in complex structured situations through the use of simple statistical learning mechanisms. However, the authors fail to draw a distinction between, on the one hand, subjects' representations which emerge from type-1 learning mechanisms, and, on the other, their knowledge of the genuine abstract “recoding function” which defines a type-2 problem.

A characterization of lambda-terms transforming numerals

2016 ◽  
Vol 26 ◽  
Author(s):  
PAWEŁ PARYS
Keyword(s):  
Natural Number ◽  
Linear Transformation ◽  
Fixed Number ◽  
The Other ◽  
Natural Numbers ◽  
Data Types ◽  
Fixed Type ◽  
Intersection Types ◽  
The One

AbstractIt is well known that simply typed λ-terms can be used to represent numbers, as well as some other data types. We show that λ-terms of each fixed (but possibly very complicated) type can be described by a finite piece of information (a set of appropriately defined intersection types) and by a vector of natural numbers. On the one hand, the description is compositional: having only the finite piece of information for two closed λ-terms M and N, we can determine its counterpart for MN, and a linear transformation that applied to the vectors of numbers for M and N gives us the vector for MN. On the other hand, when a λ-term represents a natural number, then this number is approximated by a number in the vector corresponding to this λ-term. As a consequence, we prove that in a λ-term of a fixed type, we can store only a fixed number of natural numbers, in such a way that they can be extracted using λ-terms. More precisely, while representing k numbers in a closed λ-term of some type, we only require that there are k closed λ-terms M1,. . .,Mk such that Mi takes as argument the λ-term representing the k-tuple, and returns the i-th number in the tuple (we do not require that, using λ-calculus, one can construct the representation of the k-tuple out of the k numbers in the tuple). Moreover, the same result holds when we allow that the numbers can be extracted approximately, up to some error (even when we only want to know whether a set is bounded or not). All the results remain true when we allow the Y combinator (recursion) in our λ-terms, as well as uninterpreted constants.

scholarly journals Modern approaches to the treatment of type 2 diabetes mellitus and its complications

2012 ◽  
Vol 58 (3) ◽  
pp. 61-64
Author(s):  
A S Ametov ◽  
E V Doskina
Keyword(s):  
Diabetes Mellitus ◽  
Hba1c Level ◽  
Platelet Adhesion ◽  
International Diabetes Federation ◽  
The Other ◽  
The World ◽  
The Mean ◽  
The One ◽  
Hba1c Levels

According to the International Diabetes Federation, there are over 366 mln subjects suffering diabetes mellitus (DM) in the world. This figure is expected to reach 552 mln by 2030. The patients are treated with preparations acting on different components of DM pathogenesis on the one hand and with medicines facilitating prophylaxis of the disease on the other hand. Diabeton MB decreases the mean HbA1c level of 7-8% by 0.9%. Also, it causes reduction of the initial HbA1c levels of 8-9% and 10% by 1.7% (2.6---??) and 4.2% respectively. Diabeton MB produces a number of other effects besides the hypoglycemic activity; specifically, it reduces the intensity of LDLP oxydation, platelet adhesion and aggregation, adhesion of monocytes, etc.

operators and alternating sentences in arithmetic

1980 ◽  
Vol 45 (1) ◽  
pp. 144-154 ◽  
Author(s):  
Larry Manevitz ◽  
Jonathan Stavi
Keyword(s):  
Standard Model ◽  
Natural Number ◽  
Combinatorial Problem ◽  
The Other ◽  
Predicate Calculus ◽  
Completeness Proof ◽  
The Standard Model ◽  
Truth Value ◽  
The One ◽  
Definition Of

Determining the truth value of self-referential sentences is an interesting and often tricky problem. The Gödel sentence, asserting its own unprovability in P (Peano arithmetic), is clearly true in N(the standard model of P), and Löb showed that a sentence asserting its own provability in P is also true in N (see Smorynski [Sm, 4.1.1]). The problem is more difficult, and still unsolved, for sentences of the kind constructed by Kreisel [K1], which assert their own falsity in some model N* of P whose complete diagram is arithmetically defined. Such a sentence χ has the property that N ⊨ iff N* ⊭ χ (note that ¬χ has the same property).We show in §1 that the truth value in N of such a sentence χ, after a certain normalization that breaks the symmetry between it and its negation, is determined by the parity of a natural number, called the rank of N, for the particular construction of N* used. The rank is the number of times the construction can be iterated starting from N and is finite for all the usual constructions. We also show that modifications of, e.g., Henkin's construction (in his completeness proof of predicate calculus) allow arbitrary finite values for the rank of N. Thus, on the one hand the truth value of χ in N, for a given “nice” construction of N*, is independent of the particular (normalized) choice of χ, and we shall see that χ is unique up to (provable) equivalence in P. On the other hand, the truth value in question is sensitive to minor changes in the definition of N* and its determination seems to be largely a combinatorial problem.

On the paradox of grounded classes

1955 ◽  
Vol 20 (2) ◽  
pp. 140-140 ◽  
Author(s):  
Richard Montague
Keyword(s):  
Natural Number ◽  
Set Theory ◽  
Infinite Sequence ◽  
Axiom Of Choice ◽  
The Other ◽  
Other Hand ◽  
The Family ◽  
The One ◽  
The Axiom Of Choice ◽  
Regular Classes

Mr. Shen Yuting, in this Journal, vol. 18, no. 2 (June, 1953), stated a new paradox of intuitive set-theory. This paradox involves what Mr. Yuting calls the class of all grounded classes, that is, the family of all classes a for which there is no infinite sequence b such that … ϵ bn ϵ … ϵ b2ϵb1 ϵ a.Now it is possible to state this paradox without employing any complex set-theoretical notions (like those of a natural number or an infinite sequence). For let a class x be called regular if and only if (k)(x ϵ k ⊃ (∃y)(y ϵ k · ~(∃z)(z ϵ k · z ϵ y))). Let Reg be the class of all regular classes. I shall show that Reg is neither regular nor non-regular.Suppose, on the one hand, that Reg is regular. Then Reg ϵ Reg. Now Reg ϵ ẑ(z = Reg). Therefore, since Reg is regular, there is a y such that y ϵ ẑ(z = Reg) · ~(∃z)(z ϵ z(z = Reg) · z ϵ y). Hence ~(∃z)(z ϵ ẑ(z = Reg) · z ϵ Reg). But there is a z (namely Reg) such that z ϵ ẑ(z = Reg) · z ϵ Reg.On the other hand, suppose that Reg is not regular. Then, for some k, Reg ϵ k · [1] (y)(y ϵ k ⊃ (∃z)(z ϵ k · z ϵ y)). It follows that, for some z, z ϵ k · z ϵ Reg. But this implies that (ϵy)(y ϵ k · ~(ϵw)(w ϵ k · w ϵ y)), which contradicts [1].It can easily be shown, with the aid of the axiom of choice, that the regular classes are just Mr. Yuting's grounded classes.

scholarly journals The genus, Frobenius number and pseudo-Frobenius numbers of numerical semigroups of type 2

2016 ◽  
Vol 146 (5) ◽  
pp. 1081-1090
Author(s):  
Aureliano M. Robles-Pérez ◽  
José Carlos Rosales
Keyword(s):  
Numerical Semigroup ◽  
Sufficient Conditions ◽  
Frobenius Number ◽  
The Other ◽  
Numerical Semigroups ◽  
Frobenius Numbers ◽  
The One ◽  
Necessary And Sufficient ◽  
Positive Integers

We study some questions on numerical semigroups of type 2. On the one hand, we investigate the relation between the genus and the Frobenius number. On the other hand, for two fixed positive integers g1, g2, we give necessary and sufficient conditions in order to have a numerical semigroup S such that {g1, g2} is the set of its pseudo-Frobenius numbers and, moreover, we explicitly build families of such numerical semigroups.

scholarly journals Finding paths through narrow and wide trees

2009 ◽  
Vol 74 (1) ◽  
pp. 349-360 ◽  
Author(s):  
Stephen Binns ◽  
Bjørn Kjos-Hanssen
Keyword(s):  
Second Order ◽  
Binary Trees ◽  
Second Order Arithmetic ◽  
Order Arithmetic ◽  
Weak König’S Lemma ◽  
König’S Lemma ◽  
Dual Statement

AbstractWe consider two axioms of second-order arithmetic. These axioms assert, in two different ways, that infinite but narrow binary trees always have infinite paths. We show that both axioms are strictly weaker than Weak König's Lemma, and incomparable in strength to the dual statement (WWKL) that wide binary trees have paths.

Note on Selection of Coordinate Systems for Geodynamics

1975 ◽  
Vol 26 ◽  
pp. 395-407
Author(s):  
S. Henriksen
Keyword(s):  
Sea Level ◽  
The Other ◽  
Coordinate Systems ◽  
Mean Sea Level ◽  
The Earth ◽  
The One ◽  
Static Systems ◽  
Selection Of

The first question to be answered, in seeking coordinate systems for geodynamics, is: what is geodynamics? The answer is, of course, that geodynamics is that part of geophysics which is concerned with movements of the Earth, as opposed to geostatics which is the physics of the stationary Earth. But as far as we know, there is no stationary Earth – epur sic monere. So geodynamics is actually coextensive with geophysics, and coordinate systems suitable for the one should be suitable for the other. At the present time, there are not many coordinate systems, if any, that can be identified with a static Earth. Certainly the only coordinate of aeronomic (atmospheric) interest is the height, and this is usually either as geodynamic height or as pressure. In oceanology, the most important coordinate is depth, and this, like heights in the atmosphere, is expressed as metric depth from mean sea level, as geodynamic depth, or as pressure. Only for the earth do we find “static” systems in use, ana even here there is real question as to whether the systems are dynamic or static. So it would seem that our answer to the question, of what kind, of coordinate systems are we seeking, must be that we are looking for the same systems as are used in geophysics, and these systems are dynamic in nature already – that is, their definition involvestime.

Stories and the Self

2020 ◽  
Vol 32 (2) ◽  
pp. 47-58 ◽  
Author(s):  
Stefan Krause ◽  
Markus Appel
Keyword(s):  
Meta Analysis ◽  
The Self ◽  
The Other ◽  
Lower Degree ◽  
Contrast Effects ◽  
Self Perception ◽  
Self Perceptions ◽  
Other Hand ◽  
The One ◽  
Implicit And Explicit

Abstract. Two experiments examined the influence of stories on recipients’ self-perceptions. Extending prior theory and research, our focus was on assimilation effects (i.e., changes in self-perception in line with a protagonist’s traits) as well as on contrast effects (i.e., changes in self-perception in contrast to a protagonist’s traits). In Experiment 1 ( N = 113), implicit and explicit conscientiousness were assessed after participants read a story about either a diligent or a negligent student. Moderation analyses showed that highly transported participants and participants with lower counterarguing scores assimilate the depicted traits of a story protagonist, as indicated by explicit, self-reported conscientiousness ratings. Participants, who were more critical toward a story (i.e., higher counterarguing) and with a lower degree of transportation, showed contrast effects. In Experiment 2 ( N = 103), we manipulated transportation and counterarguing, but we could not identify an effect on participants’ self-ascribed level of conscientiousness. A mini meta-analysis across both experiments revealed significant positive overall associations between transportation and counterarguing on the one hand and story-consistent self-reported conscientiousness on the other hand.

Radioimmunotherapy for treatment of acute myeloid leukaemia and myelodysplastic syndrome

2005 ◽  
Vol 44 (03) ◽  
pp. 107-117
Author(s):  
R. G. Meyer ◽  
W. Herr ◽  
A. Helisch ◽  
P. Bartenstein ◽  
I. Buchmann
Keyword(s):  
Acute Myeloid Leukaemia ◽  
Myeloid Leukaemia ◽  
Primary Tumour ◽  
The Other ◽  
Haematopoietic Stem Cell ◽  
Other Hand ◽  
Primary Reduction ◽  
The One ◽  
Acute Myeloid

SummaryThe prognosis of patients with acute myeloid leukaemia (AML) has improved considerably by introduction of aggressive consolidation chemotherapy and haematopoietic stem cell transplantation (SCT). Nevertheless, only 20-30% of patients with AML achieve long-term diseasefree survival after SCT. The most common cause of treatment failure is relapse. Additionally, mortality rates are significantly increased by therapy-related causes such as toxicity of chemotherapy and complications of SCT. Including radioimmunotherapies in the treatment of AML and myelodyplastic syndrome (MDS) allows for the achievement of a pronounced antileukaemic effect for the reduction of relapse rates on the one hand. On the other hand, no increase of acute toxicity and later complications should be induced. These effects are important for the primary reduction of tumour cells as well as for the myeloablative conditioning before SCT.This paper provides a systematic and critical review of the currently used radionuclides and immunoconjugates for the treatment of AML and MDS and summarizes the literature on primary tumour cell reductive radioimmunotherapies on the one hand and conditioning radioimmunotherapies before SCT on the other hand.

Sign in / Sign up

Export Citation Format

Share Document