§1. Introduction. Asymptotic cones of metric spaces were first invented by Gromov. They are metric spaces which capture the ‘large-scale structure’ of the underlying metric space. Later, van den Dries and Wilkie gave a more general construction of asymptotic cones using ultrapowers. Certain facts about asymptotic cones, like the completeness of the metric space, now follow rather easily from saturation properties of ultrapowers, and in this survey, we want to present two applications of the van den Dries-Wilkie (...) approach. Using ultrapowers we obtain an explicit description of the asymptotic cone of a semisimple Lie group. From this description, using semi-algebraic groups and non-standard methods, we can give a short proof of the Margulis Conjecture. In a second application, we use set theory to answer a question of Gromov.§2. Definitions. The intuitive idea behind Gromov's concept of an asymptotic cone was to look at a given metric space from an ‘infinite distance’, so that large-scale patterns should become visible. In his original definition this was done by gradually scaling down the metric by factors 1/nfornϵ ℕ. In the approach by van den Dries and Wilkie, this idea was captured by ultrapowers. Their construction is more general in the sense that the asymptotic cone exists for any metric space, whereas in Gromov's original definition, the asymptotic cone existed only for a rather restricted class of spaces. (shrink)

This essay touches on a number of topics in philosophy of quantum field theory from the point of view of the LSZ asymptotic approach to scattering theory. First, particle/field duality is seen to be a property of free field theory and not of interacting QFT. Second, it is demonstrated how LSZ side-steps the implications of Haag's theorem. Finally, a recent argument due to Redhead, Malament and Arageorgis against the concept of localized particle states is addressed. Briefly, the argument observes (...) that the Reeh-Schlieder theorem entails that correlations between spacelike separated vacuum expectation values of local field operators are always present, and this, according to the above authors, dictates against the notion of a localized particle state. I claim that this moral is excessive and that a coherent notion of localized particles is given by the LSZ approach. The underlying moral to be drawn from this analysis is that questions concerning the ontology of interacting QFT cannot be appropriately addressed if one restricts oneself to the free theory. (shrink)

We prove a 0-1 law for the fragment of second order logic SO over parametric classes of finite structures which allow only one unary atomic type. This completes the investigation of 0-1 laws for fragments of second order logic defined in terms of first order quantifier prefixes over, e.g., simple graphs and tournaments. We also prove a low oscillation law, and establish the 0-1 law for Σ14 without any restriction on the number of unary types.

§1. Introduction. Asymptotic cones of metric spaces were first invented by Gromov. They are metric spaces which capture the ‘large-scale structure’ of the underlying metric space. Later, van den Dries and Wilkie gave a more general construction of asymptotic cones using ultrapowers. Certain facts about asymptotic cones, like the completeness of the metric space, now follow rather easily from saturation properties of ultrapowers, and in this survey, we want to present two applications of the van den Dries-Wilkie (...) approach. Using ultrapowers we obtain an explicit description of the asymptotic cone of a semisimple Lie group. From this description, using semi-algebraic groups and non-standard methods, we can give a short proof of the Margulis Conjecture. In a second application, we use set theory to answer a question of Gromov.§2. Definitions. The intuitive idea behind Gromov's concept of an asymptotic cone was to look at a given metric space from an ‘infinite distance’, so that large-scale patterns should become visible. In his original definition this was done by gradually scaling down the metric by factors 1/nfornϵ ℕ. In the approach by van den Dries and Wilkie, this idea was captured by ultrapowers. Their construction is more general in the sense that the asymptotic cone exists for any metric space, whereas in Gromov's original definition, the asymptotic cone existed only for a rather restricted class of spaces. (shrink)

Investigating the causal relationship between exposure and time-to-event outcome is an important topic in biomedical research. Previous literature has discussed the potential issues of using hazard ratio (HR) as the marginal causal effect measure due to noncollapsibility. In this article, we advocate using restricted mean survival time (RMST) difference as a marginal causal effect measure, which is collapsible and has a simple interpretation as the difference of area under survival curves over a certain time horizon. To address both measured and (...) unmeasured confounding, a matched design with sensitivity analysis is proposed. Matching is used to pair similar treated and untreated subjects together, which is generally more robust than outcome modeling due to potential misspecifications. Our propensity score matched RMST difference estimator is shown to be asymptotically unbiased, and the corresponding variance estimator is calculated by accounting for the correlation due to matching. Simulation studies also demonstrate that our method has adequate empirical performance and outperforms several competing methods used in practice. To assess the impact of unmeasured confounding, we develop a sensitivity analysis strategy by adapting the E-value approach to matched data. We apply the proposed method to the Atherosclerosis Risk in Communities Study (ARIC) to examine the causal effect of smoking on stroke-free survival. (shrink)

ABSTRACT The Gödel–Dummett logic and Łukasiewicz one are two main many-valued logics used by the fuzzy logic community. Our goal is a quantitative comparison of these two. In this paper, we will mostly consider the 3-valued Gödel–Dummett logic as well as the 3-valued Łukasiewicz one. We shall concentrate on their implicational-negation fragments which are limited to formulas formed with a fixed finite number of variables. First, we investigate the proportion of the number of true formulas of a certain length n (...) to the number of all formulas of such length built with exactly one variable. Then, we investigate such proportion for satisfiable formulas. Second, we generalise our investigation on formulas written with $ k\ge 1 $ k ≥ 1 variables. The primary goal of the paper is the research on the asymptotic behaviour of these fractions when the length n tends to infinity. If such limits exists, they are real numbers between 0 and 1, which are called the density of truth or the density of SAT. To compare the density of truth and the density of satisfiable formulas for both fragments of 3-valued Gödel–Dummett's and Łukasiewicz's logics we use the powerful theory of analytic combinatorics. This paper is a natural continuation of the previous brief conference note by Kostrzycka and Zaionc (2020) as well as enriched with some previous results from Kostrzycka and Zaionc (2003). In the conference note we computed analytically the density of truth and the density of SAT (with a determined precision) for 3-valued Łukasiewicz's logic restricted to a language with only one variable. In Kostrzycka and Zaionc (2003) we computed the same values for exactly the same fragment of the 3-valued Gödel–Dummett logic. This paper answers the more general questions of the existence of density of truth and density of SAT for both many-valued logics with an arbitrary finite number of variables. Therefore this paper gives an an interesting picture of two main families of finite-valued fuzzy logics problems treated quantitatively. This picture is taken from the perspective of classical logic. It shows that unexpectedly there is quantitatively a little distance between these two approaches. (shrink)

The Gödel–Dummett logic and Łukasiewicz one are two main many-valued logics used by the fuzzy logic community. Our goal is a quantitative comparison of these two. In this paper, we will mostly consider the 3-valued Gödel–Dummett logic as well as the 3-valued Łukasiewicz one. We shall concentrate on their implicational-negation fragments which are limited to formulas formed with a fixed finite number of variables. First, we investigate the proportion of the number of true formulas of a certain length n to (...) the number of all formulas of such length built with exactly one variable. Then, we investigate such proportion for satisfiable formulas. Second, we generalise our investigation on formulas written with k≥1 variables. The primary goal of the paper is the research on the asymptotic behaviour of these fractions when the length n tends to infinity. If such limits exists, they are real numbers between 0 and 1, which are called the density of truth or the density of SAT. To compare the density of truth and the density of satisfiable formulas for both fragments of 3-valued Gödel–Dummett's and Łukasiewicz's logics we use the powerful theory of analytic combinatorics. This paper is a natural continuation of the previous brief conference note by Kostrzycka and Zaionc (Citation2020) as well as enriched with some previous results from Kostrzycka and Zaionc (Citation2003). In the conference note we computed analytically the density of truth and the density of SAT (with a determined precision) for 3-valued Łukasiewicz's logic restricted to a language with only one variable. In Kostrzycka and Zaionc (Citation2003) we computed the same values for exactly the same fragment of the 3-valued Gödel–Dummett logic. This paper answers the more general questions of the existence of density of truth and density of SAT for both many-valued logics with an arbitrary finite number of variables. Therefore this paper gives an an interesting picture of two main families of finite-valued fuzzy logics problems treated quantitatively. This picture is taken from the perspective of classical logic. It shows that unexpectedly there is quantitatively a little distance between these two approaches. (shrink)

We investigate expansions of the ordered field of real numbers equipped with a family of real power functions. We show in particular that the theory of the ordered field of real numbers augmented by all restricted analytic functions and all real power functions admits elimination of quantifiers and has a universal axiomatization. We derive that every function of one variable definable in this structure, not ultimately identically 0, is asymptotic at + ∞ to a real function of the form (...) x cxr, c ≠ 0; in particular, this structure is polynomially bounded. Furthermore, given any definable function f:U → with U open in n, if α ε U and f is infinitely differentiable at α, then f is real analytic in a neighborhood of α. (shrink)

In General Relativity in Hamiltonian form, change has seemed to be missing, defined only asymptotically, or otherwise obscured at best, because the Hamiltonian is a sum of first-class constraints and a boundary term and thus supposedly generates gauge transformations. By construing change as essential time dependence, one can find change locally in vacuum GR in the Hamiltonian formulation just where it should be. But what if spinors are present? This paper is motivated by the tendency in space-time philosophy tends to (...) slight fermionic/spinorial matter, the tendency in Hamiltonian GR to misplace changes of time coordinate, and the tendency in treatments of the Einstein-Dirac equation to include a gratuitous local Lorentz gauge symmetry along with the physically significant coordinate freedom. Spatial dependence is dropped in most of the paper, both restricting the physical situation and largely fixing the spatial coordinates. In the interest of including all and only the coordinate freedom, the Einstein-Dirac equation is investigated using the Schwinger time gauge and Kibble-Deser symmetric triad condition are employed as a \ version of the DeWitt-Ogievetsky-Polubarinov nonlinear group realization formalism that dispenses with a tetrad and local Lorentz gauge freedom. Change is the lack of a time-like stronger-than-Killing field for which the Lie derivative of the metric-spinor complex vanishes. An appropriate \-friendly form of the Rosenfeld-Anderson-Bergmann-Castellani gauge generator G, a tuned sum of first class-constraints, is shown to change the canonical Lagrangian by a total derivative, implying the preservation of Hamilton’s equations. Given the essential presence of second-class constraints with spinors and their lack of resemblance to a gauge theory, it is useful to have an explicit physically interesting example. This gauge generator implements changes of time coordinate for solutions of the equations of motion, showing that the gauge generator makes sense even with spinors. (shrink)

In this paper, we put forward a time-delay ecological competition system with food restriction and diffusion terms under Neumann boundary conditions. For the case without delay, the conditions for local asymptotic stability and Turing instability are constructed. For the case with delay, the existence of Hopf bifurcation is demonstrated by analyzing the root distribution of the corresponding characteristic equations. Furthermore, by using the normal form theory and the center manifold reduction of partial functional differential equations, explicit formulas are obtained (...) to determine the direction of bifurcations and the stability of bifurcating periodic solutions. Finally, some simulation examples are provided to substantiate our analysis. (shrink)

The output feedback controller is designed for a class of stochastic nonlinear systems that satisfy uncertain function growth conditions for the first time. The multivariate function growth condition has greatly relaxed the restrictions on the drift and diffusion terms in the original stochastic nonlinear system. Here, we cleverly handle the problem of uncertain functions in the scaling process through the function maxima theory so that the Ito differential system can achieve output stabilization through Lyapunov function design and the solution (...) of stochastic nonlinear system objects satisfies the existence of uniqueness, ensuring that the system is globally asymptotically stable in the sense of probability. Furthermore, it is concluded that the system is inversely optimally stable in the sense of probability. Finally, we apply the theoretical results to the practical subsea intelligent electroexecution robot control system and obtain good results. (shrink)

Natural language is full of patterns that appear to fit with general linguistic rules but are ungrammatical. There has been much debate over how children acquire these “linguistic restrictions,” and whether innate language knowledge is needed. Recently, it has been shown that restrictions in language can be learned asymptotically via probabilistic inference using the minimum description length (MDL) principle. Here, we extend the MDL approach to give a simple and practical methodology for estimating how much linguistic data are (...) required to learn a particular linguistic restriction. Our method provides a new research tool, allowing arguments about natural language learnability to be made explicit and quantified for the first time. We apply this method to a range of classic puzzles in language acquisition. We find some linguistic rules appear easily statistically learnable from language experience only, whereas others appear to require additional learning mechanisms (e.g., additional cues or innate constraints). (shrink)

An actual infinity of colliding balls can be in a configuration in which the laws of mechanics lead to logical inconsistency. It is argued that one should therefore limit the domain of these laws to a finite, or only a potentially infinite number of elements. With this restriction indeterminism, energy nonconservation and creatio ex nihilo no longer occur. A numerical analysis of finite systems of colliding balls is given, and the asymptotic behaviour that corresponds to the potentially infinite system (...) is inferred. (shrink)

In this paper I illustrate the evolution of series theory from Leibniz and Newton to the first decades of the eighteenth century. Although mathematicians used convergent series to solve geometric problems, they manipulated series by a mere extension of the rules valid for finite series, without considering convergence as a preliminary condition. Further, they conceived of a power series as a result of a process of the expansion of a finite analytical expression and thought that the link between series and (...) analytical expression was not restricted to the interval of convergence. This gave rise to formal aspects that became progressively more evident while the complexity of the theory increased. Asymptotic and recurrence series emerged as the result of the natural evolution of theory, without the difference between these infinite processes with respect to ordinary series being highlighted. The various aspects of dealing with series can be viewed today as derived from different definitions of the sum. However, mathematicians of that time always considered them as different approaches to a single theory that was based on a unique notion of the sum (even though, later in the eighteenth century, they disagree about what this notion was). (shrink)

In this paper I illustrate the evolution of series theory from Leibniz and Newton to the first decades of the eighteenth century. Although mathematicians used convergent series to solve geometric problems, they manipulated series by a mere extension of the rules valid for finite series, without considering convergence as a preliminary condition. Further, they conceived of a power series as a result of a process of the expansion of a finite analytical expression and thought that the link between series and (...) analytical expression was not restricted to the interval of convergence. This gave rise to formal aspects that became progressively more evident while the complexity of the theory increased. Asymptotic and recurrence series emerged as the result of the natural evolution of theory, without the difference between these infinite processes with respect to ordinary series being highlighted. The various aspects of dealing with series can be viewed today as derived from different definitions of the sum. However, mathematicians of that time always considered them as different approaches to a single theory that was based on a unique notion of the sum (even though, later in the eighteenth century, they disagree about what this notion was). (shrink)

We study connections between classical asymptotic density, computability and computable enumerability. In an earlier paper, the second two authors proved that there is a computably enumerable set A of density 1 with no computable subset of density 1. In the current paper, we extend this result in three different ways: The degrees of such sets A are precisely the nonlow c.e. degrees. There is a c.e. set A of density 1 with no computable subset of nonzero density. There is (...) a c.e. set A of density 1 such that every subset of A of density 1 is of high degree. We also study the extent to which c.e. sets A can be approximated by their computable subsets B in the sense that A\B has small density. There is a very close connection between the computational complexity of a set and the arithmetical complexity of its density and we characterize the lower densities, upper densities and densities of both computable and computably enumerable sets. We also study the notion of "computable at density r" where r is a real in the unit interval. Finally, we study connections between density and classical smallness notions such as immunity, hyperimmunity, and cohesiveness. (shrink)

We classify the asymptotic densities of the sets according to their level in the Ershov hierarchy. In particular, it is shown that for, a real is the density of an n‐c.e. set if and only if it is a difference of left‐ reals. Further, we show that the densities of the ω‐c.e. sets coincide with the densities of the sets, and there are ω‐c.e. sets whose density is not the density of an n‐c.e. set for any.

If we want to retain classical logic and standard syntax in light of the liar, we are forced to restrict the T-schema. The traditional philosophical justification for this is sentential – liar sentences somehow malfunction. But the standard formal way of implementing this is conditional, our T-sentences tell us that if “p” does not malfunction, then “p” is true if and only if p. Recently Bacon and others have pointed out that conditional T-restrictions like this flirt with incoherence. If (...) we want to keep the “malfunction” motivation, our only other option is to non-conditionally restrict the T-schema, but Field and others have given powerful philosophical and technical arguments against this kind of approach. Here I argue that if we really take the philosophical motivation for restricting T-sentences seriously, we can explain why conditional restrictions fail, answer Field's argument, and reason in a coherent way about truth using a non-conditional restriction strategy. This cracks the door open for a fully classical response to the liar and related paradoxes. In closing, I argue that, when properly understood, this kind of “restriction” is not really a restriction at all. If this is right, then the holy grail of liar studies (classical logic, naïve truth, and standard syntax) may yet be attainable. (Note for readers: when this paper was first put online, the typesetters had changed some instances of corners to brackets, leading to confusion. The paper has now been corrected online by PPR, so please make sure you have the corrected version before reading or citing.). (shrink)

Motivated by problems that arise in computing degrees of belief, we consider the problem of computing asymptotic conditional probabilities for first-order sentences. Given first-order sentences φ and θ, we consider the structures with domain {1,..., N} that satisfy θ, and compute the fraction of them in which φ is true. We then consider what happens to this fraction as N gets large. This extends the work on 0-1 laws that considers the limiting probability of first-order sentences, by considering (...) class='Hi'>asymptotic conditional probabilities. As shown by Liogon'kii [24], if there is a non-unary predicate symbol in the vocabulary, asymptotic conditional probabilities do not always exist. We extend this result to show that asymptotic conditional probabilities do not always exist for any reasonable notion of limit. Liogon'kii also showed that the problem of deciding whether the limit exists is undecidable. We analyze the complexity of three problems with respect to this limit: deciding whether it is well-defined, whether it exists, and whether it lies in some nontrivial interval. Matching upper and lower bounds are given for all three problems, showing them to be highly undecidable. (shrink)

When the first r lower extreme order statistics of a sample of large size n, 1 < r < s < n, are observed, asymptotic predictive intervals of the future extreme order statistic with a rank s are constructed. The only assumption that we adopt is that the first failure time is attracted to the Weibull distribution. In addition, we suggest an efficient point estimator of its shape parameter and then a confidence interval is constructed for it. Moreover, new (...) interesting asymptotic properties of the distributions that belong to the minimum domain of attraction of the Weibull distribution are revealed. Furthermore, extensive simulation studies are conducted to demonstrate the efficiency of the proposed methods. Two real datasets are analyzed to illustrate and corroborate the obtained results. The main results concern large samples. (shrink)

In this paper we consider classes of finite structures where we have good control over the sizes of the definable sets. The motivating example is the class of finite fields: it was shown in [1] that for any formulain the language of rings, there are finitely many pairs (d,μ) ∈ω×Q>0so that in any finite fieldFand for any ā ∈Fmthe size |ø(Fn,ā)| is “approximately”μ|F|d. Essentially this is a generalisation of the classical Lang-Weil estimates from the category of varieties to that of (...) the first-order-definable sets. (shrink)

Asymptotic models in which singular limits are taken are very common in physics. They are often used to investigate the general behaviour of systems undergoing rapid, discontinuous, changes. The singularities in the mathematics of these systems have no physical counterparts; these models operate by containing non-physically interpretable fictional elements. As such there is an intuition that states that asymptotics only offer descriptions of systems not explanations of them. By contrast, in different areas of science other models containing fictional elements (...) which are physically interpretable are claimed to be explanatory. I argue that both types of fictional model possess modal content, and therefore it is unclear why models that contain unphysical fictions are merely descriptions, but models that contain physical fictions are explanations. One must either reject both as unexplanatory because they use false ontology to explain, or one should accept both types as explanatory. (shrink)

All the major inter-theoretic relations of fundamental science are asymptotic ones, e.g. quantum theory as Planck's constant h 0, yielding (roughly) Newtonian mechanics. Thus asymptotics ultimately grounds claims about inter-theoretic explanation, reduction and emergence. This paper examines four recent, central claims by Batterman concerning asymptotics and reduction. While these claims are criticised, the discussion is used to develop an enriched, dynamically-based account of reduction and emergence, to show its capacity to illuminate the complex variety of inter-theory relationships in physics, (...) and to provide a principled resolution to such persistent philosophical problems as multiple realisability and the nature of the special sciences. Introduction Exposition Examination I: Claims (1) and (2), asymptotic explanation and reference Examination II: Claim (3), reduction and singular asymptotics Examination III: Claim (4), emergence and multiple realisability Conclusion. (shrink)

We show that, when the number of participating agents n tends to infinity, all classical social choice rules are asymptotically strategy -proof with the proportion of manipulable profiles being of order O.

We present a general family of asymptotic solutions to Einstein's equation which are asymptotically flat but do not satisfy the peeling theorem. Near scri, the Weyl tensor obeys a logarithmic asymptotic flatness condition and has a partial peeling property. The physical significance of this asymptotic behavior arises from a quasi-Newtonian treatment of the radiation from a collapsing dust cloud. Practically all the scri formalism carries over intact to this new version of asymptotic flatness.

A traditional view of mathematical modeling holds, roughly, that the more details of the phenomenon being modeled that are represented in the model, the better the model is. This paper argues that often times this ‘details is better’ approach is misguided. One ought, in certain circumstances, to search for an exactly solvable minimal model—one which is, essentially, a caricature of the physics of the phenomenon in question.

This paper presents a systematic approach for obtaining results from the area of quantitative investigations in logic and type theory. We investigate the proportion between tautologies (inhabited types) of a given length n against the number of all formulas (types) of length n. We investigate an asymptotic behavior of this fraction. Furthermore, we characterize the relation between number of premises of implicational formula (type) and the asymptotic probability of finding such formula among the all ones. We also deal (...) with a distribution of these asymptotic probabilities. Using the same approach we also prove that the probability that randomly chosen fourth order type (or type of the order not greater than 4), which admits decidable lambda definability problem, is zero. (shrink)

One method to determine the asymptotics of particular solutions of a difference equation is by solving an associated asymptotic functional equation. Here we study the behaviour of the solutions in an asymptotic neighbourhood of such individual solutions. We identify several types of attraction and repulsion, which range from almost orthogonality to almost parallelness. Necessary and sufficient conditions for these types of behaviour are given.

A heuristic proof is given that the divergent QCD perturbation series is, asymptotic. By treating it as an asymptotic expansion we show that it makes sense to keep only the first few terms. The example of e+e− annihilation is considered. It is shown that by keeping only the first few terms one can get within a per cent (or smaller) of the complete sum of the series even at very low momenta where the coupling is large. More generally, (...) this affords an explanation of the phenomena of precocious scaling and why keeping only leading order corrections generally works so well. (shrink)

In this work, we study a several species aerobic chemostat model with constant recycle sludge concentration in continuous culture. We reduce the number of parameters by considering a dimensionless model. First, the existence of a global positive uniform attractor for the model with different removal rates is proved using the theory of dissipative dynamical systems. Hence, we investigate the asymptotic behavior of the model under small perturbations using methods of singular perturbation theory and we prove that, in the case (...) of two species in competition, the unique equilibrium which is positive is globally asymptotically stable. Finally, we establish the link between the open problem of the chemostat with different removal rates and monotone functional responses, and our model when two species compete on the same nutrient. We give some numerical simulations to illustrate the results. (shrink)

We introduce the concept of o-asymptotic classes of finite structures, melding ideas coming from 1-dimensional asymptotic classes and o-minimality. Along with several examples and non-examples of these classes, we present some classification theory results of their infinite ultraproducts: Every infinite ultraproduct of structures in an o-asymptotic class is superrosy of U^þ-rank 1, and NTP2 (in fact, inp-minimal).

We show that the theory Tlog of the asymptotic couple of the field of logarithmic transseries is distal. As distal theories are NIP, this provides a new proof that Tlog is NIP.

In this paper, we study the asymptotic behavior of solutions to the Kirchhoff type stochastic plate equation driven by additive noise defined on unbounded domains. We first prove the uniform estimates of solutions and then establish the existence and upper semicontinuity of random attractors.

Matrix models are widely used in biology to predict the temporal evolution of stage-structured populations. One issue related to matrix models that is often disregarded is the sampling variability. As the sample used to estimate the vital rates of the models are of finite size, a sampling error is attached to parameter estimation, which has in turn repercussions on all the predictions of the model. In this study, we address the question of building confidence bounds around the predictions of matrix (...) models due to sampling variability. We focus on a density-dependent Usher model, the maximum likelihood estimator of parameters, and the predicted stationary stage vector. The asymptotic distribution of the stationary stage vector is specified, assuming that the parameters of the model remain in a set of the parameter space where the model admits one unique equilibrium point. Tests for density-dependence are also incidentally provided. The model is applied to a tropical rain forest in French Guiana. (shrink)

Skolem studied the germs at infinity of the smallest class of real valued functions on the positive real line containing the constant $1$, the identity function ${\mathbf {x}}$, and such that whenever f and g are in the set, $f+g,fg$ and $f^g$ are in the set. This set of germs is well ordered and Skolem conjectured that its order type is epsilon-zero. Van den Dries and Levitz computed the order type of the fragment below $2^{2^{\mathbf {x}}}$. Here we prove that (...) the set of asymptotic classes within any Archimedean class of Skolem functions has order type $\omega $. As a consequence we obtain, for each positive integer n, an upper bound for the fragment below $2^{n^{\mathbf {x}}}$. We deduce an epsilon-zero upper bound for the fragment below $2^{{\mathbf {x}}^{\mathbf {x}}}$, improving the previous epsilon-omega bound by Levitz. A novel feature of our approach is the use of Conway’s surreal number for asymptotic calculations. (shrink)

Skolem studied the germs at infinity of the smallest class of real valued functions on the positive real line containing the constant $1$, the identity function ${\mathbf {x}}$, and such that whenever f and g are in the set, $f+g,fg$ and $f^g$ are in the set. This set of germs is well ordered and Skolem conjectured that its order type is epsilon-zero. Van den Dries and Levitz computed the order type of the fragment below $2^{2^{\mathbf {x}}}$. Here we prove that (...) the set of asymptotic classes within any Archimedean class of Skolem functions has order type $\omega $. As a consequence we obtain, for each positive integer n, an upper bound for the fragment below $2^{n^{\mathbf {x}}}$. We deduce an epsilon-zero upper bound for the fragment below $2^{{\mathbf {x}}^{\mathbf {x}}}$, improving the previous epsilon-omega bound by Levitz. A novel feature of our approach is the use of Conway’s surreal number for asymptotic calculations. (shrink)

When the first r lower extreme order statistics of a sample of large size n, 1 < r < s < n, are observed, asymptotic predictive intervals of the future extreme order statistic with a rank s are constructed. The only assumption that we adopt is that the first failure time is attracted to the Weibull distribution. In addition, we suggest an efficient point estimator of its shape parameter and then a confidence interval is constructed for it. Moreover, new (...) interesting asymptotic properties of the distributions that belong to the minimum domain of attraction of the Weibull distribution are revealed. Furthermore, extensive simulation studies are conducted to demonstrate the efficiency of the proposed methods. Two real datasets are analyzed to illustrate and corroborate the obtained results. The main results concern large samples. (shrink)