相关论文: Recursive definitions on surreal numbers
The semantic paradoxes are associated with self-reference or referential circularity. However, there are infinitary versions of the paradoxes, such as Yablo's paradox, that do not involve this form of circularity. It remains an open…
In an automatic search, we found conjectural recurrences for some sequences in the OEIS that were not previously recognized as being D-finite. In some cases, we are able to prove the conjectured recurrence. In some cases, we are not able to…
Number sequences defined by a linear recursion relation are studied by means of generating functions. Indices of the terms in the recursion relation have arbitrary differenses. In addition to formulas for the nth term an algorithm is…
A fertile field of research in theoretical computer science investigates the representation of general recursive functions in intensional type theories. Among the most successful approaches are: the use of wellfounded relations,…
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)…
The aim of this paper is to investigate the cone of non-negative, radial, positive-definite functions in the set of continuous functions on $\R^d$. Elements of this cone admit a Choquet integral representation in terms of the extremals. The…
This paper introduces a new generalized superfactorial function (referable to as $n^{th}$- degree superfactorial: $sf^{(n)}(x)$) and a generalized hyperfactorial function (referable to as $n^{th}$- degree hyperfactorial: $H^{(n)}(x)$), and…
It is shown that quasi all continuous functions on the unit circle have the property that, for many small subsets E of the circle, the partial sums of their Fourier series considered as functions restricted to E exhibit certain universality…
In this paper, we argue that while the concept of a set-theoretic paradox (or paradoxical set) can be relatively well-defined within a formal setting, the concept of a set-theoretic hypodox (or hypodoxical set) remains significantly less…
In this article we treat a notion of continuity for a multi-valued function $F$ and we compute the descriptive set-theoretic complexity of the set of all $x$ for which $F$ is continuous at $x$. We give conditions under which the latter set…
The strong recurrence is equivalent to the Riemann hypothesis. On the other hand, the generalized strong recurrence holds for any irrational number. In this paper, we show the generalized strong recurrence for all non-zero rational numbers.…
The paper gives some criteria for partial sums of rational number sequences to be not rational functions and to be not algebraic functions. As an application, we study partial sums of some famous rational number sequences in mathematical…
Let $f:\mathbb{Z}\longrightarrow \{ \times \cdot\}$ be a function such that $f(a) = \cdot$ for all except finitely for many $a \in \mathbb{Z}$. We define a set $\flat f$ of non-intersecting arc (or cap) diagrams satisfying certain…
Using the sign expansion of the surreal numbers, we give a possible notion of convergence for surreal sequences.
Functionals are an important research subject in Mathematics and Computer Science as well as a challenge in Information Technologies where the current programming paradigm states that only symbolic computations are possible on higher order…
Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…
Let X be a subshift satisfy non-uniform structure. In this paper, we give quantitative estimate of the recurrence sets. These results can be applied to a large class of symbolic systems, including beta-shifts, S-gap shifts and their…
We prove that the sets $\{n \in N: n$ satisfies formula (1)$\}$ and $\{n \in N: n$ does not satisfy formula (2)$\}$ are not recursively enumerable. We prove that these sets are co-recursively enumerable. $(1)~\exists p,q \in…
We consider the class of smooth convex functions defined over an open convex set. We show that this class is essentially different than the class of smooth convex functions defined over the entire linear space by exhibiting a function that…
In this paper we develop general formulas for the subdifferential of the pointwise supremum of convex functions, which cover and unify both the compact continuous and the non-compact non-continuous settings. From the non-continuous to the…