Related papers: On Some Types of Limit

A function is boundedly finite-to-one if there is a natural number $k$ such that each point has at most $k$ inverse images. In this paper, we prove in $\mathsf{ZF}$ (i.e., the Zermelo--Fraenkel set theory without the axiom of choice)…

Some notions in mathematics can be considered relative. Relative is a term used to denote when the variation in the position of an observer implies variation in properties or measures on the observed object. We know, from Skolem theorem,…

Let A(n) be a sequence of i.i.d. topical (i.e. isotone and additively homogeneous) operators. Let $x(n,x_0)$ be defined by $x(0,x_0)=x_0$ and $x(n,x_0)=A(n)x(n-1,x_0)$. This can modelize a wide range of systems including, task graphs, train…

It is well known that limits can be computed by restricting along an initial functor, and that this often simplifies limit computation. We systematically study the algorithmic implications of this idea for diagrams indexed by a finite…

For a continuous function $f : [0,1] \to [0,1]$ we define a splitting sequence admitted by $f$ and show that the inverse limit of $f$ is an arc if and only if $f$ does not admit a splitting sequence.

Let $\mathbb{F}_q$ be a finite field of order $q$, where $q$ is a power of a prime. For a set $A \subset \mathbb{F}_q$, under certain structural restrictions, we prove a new explicit lower bound on the size of the product set $A(A + 1)$.…

We propose an operational, quantitative definition of intelligence for arbitrary physical systems. The intelligence density of a system is the ratio of the logarithm of its independent outputs to its total description length. A system…

We show that if a sequence of dense graphs has the property that for every fixed graph F, the density of copies of F in these graphs tends to a limit, then there is a natural ``limit object'', namely a symmetric measurable 2-variable…

Given a linear equation $\mathcal{L}$, a set $A$ of integers is $\mathcal{L}$-free if $A$ does not contain any `non-trivial' solutions to $\mathcal{L}$. This notion incorporates many central topics in combinatorial number theory such as…

Cut-elimination is the bedrock of proof theory. It is the algorithm that eliminates cuts from a sequent calculus proof that leads to cut-free calculi and applications. Cut-elimination applies to many logics irrespective of their semantics.…

This paper establishes calculus upon two physical facts: (1) any average velocity is always between two instantaneous velocities, and (2) the motion of an object is determined once its velocity has been determined. It directly defines…

Being mathematics a natural language to Mankind and to physics, it must be constantly adapted to our necessities and our natural perception. Then, mathematical concepts are not absolute to reality. Although mathematical theories are…

This article discusses the logical errors in the liar paradox, G\"odel's incompleteness theorems, Russell's paradox, and the halting problem. In order to avoid these errors, a redefinition of logic has been presented, which is concluded as…

In the present article we describe how one can define Hausdorff measure allowing empty elements in coverings, and using infinite countable coverings only. In addition, we discuss how the use of different nonequivalent interpretations of the…

In this paper we consider a simple algebraic structure --- sets with a single endofunction. We shall see that from the point of view of limits, even this simplest case is both interesting and difficult. Nevertheless we obtain the shape of…

In this article we propose a conception of mixed limits of functional spaces as the case, when the upper limit (projective limit of inductive limits) and the lower limit (inductive limit of projective limits) coincide as topological spaces,…

In this paper, we obtain a new estimate for uniform integrability under sublinear expectations. Based on this, we establish the limit theorems under nonlinear expectations dominated by sublinear expectations through tightness, and the limit…

Our main result is that possibly some non-null set of reals cannot be divided to uncountably many non-null sets. We deal also with a non-null set of reals, the graph of any function from it is null and deal with our iterations somewhat more…

The "basic level", according to experiments in cognitive psychology, is the level of abstraction in a hierarchy of concepts at which humans perform tasks quicker and with greater accuracy than at other levels. We argue that applications…

We consider approximation or recovery of functions based on a finite number of function evaluations. This is a well-studied problem in optimal recovery, machine learning, and numerical analysis in general, but many fundamental insights were…