Related papers: Monotone subsequence via ultrapower
Summability methods for ultraholomorphic classes in sectors, defined in terms of a strongly regular sequence $\mathbb{M}=(M_p)_{p\in\mathbb{N}_0}$, have been put forward by A. Lastra, S. Malek and the second author [1], and their validity…
We define the concept of a monotonic theory and show how to build efficient SMT (SAT Modulo Theory) solvers, including effective theory propagation and clause learning, for such theories. We present examples showing that monotonic theories…
An archetypal problem discussed in computer science is the problem of searching for a given number in a given set of numbers. Other than sequential search, the classic solution is to sort the list of numbers and then apply binary search.…
A natural connection between rational functions of several real or complex variables, and subspace collections is explored. A new class of function, superfunctions, are introduced which are the counterpart to functions at the level of…
This article is a fundamental study in computable analysis. In the framework of Type-2 effectivity, TTE, we investigate computability aspects on finite and infinite products of effective topological spaces. For obtaining uniform results we…
We generalize the lexicographic product of first-order structures by presenting a framework for constructions which, in a sense, mimic iterating the lexicographic product infinitely and not necessarily countably many times. We then define…
In standard construction of hyperrational numbers using an ultrapower we assume that the ultrafilter is selective. It makes possible to assign real value to any finite hyperrational number. So, we can consider hyperrational numbers with…
In this work, we give rigorous operational meaning to superposition of causal orders. This fits within a recent effort to understand how the standard operational perspective on quantum theory could be extended to include indefinite…
Discrete-time robust optimal control problems generally take a min-max structure over continuous variable spaces, which can be difficult to solve in practice. In this paper, we extend the class of such problems that can be solved through a…
Los's theorem, also known as the fundamental result of ultraproducts, states that the ultraproduct over a family of structures for the same language satisfies a first-order formula if and only if the set of indices for which the structures…
We introduce a notion of compatibility between constraint encoding and compositional structure. Phrased in the language of category theory, it is given by a "composable constraint encoding". We show that every composable constraint encoding…
We show how to smoothly incorporate in the object-oriented paradigm constructs to raise, compose, and handle effects in an arbitrary monad. The underlying pure calculus is meant to be a representative of the last generation of OO languages,…
Let $X$ be a compact metric space and $T:X\longrightarrow X$ be continuous. Let $h^*(T)$ be the supremum of topological sequence entropies of $T$ over all subsequences of $\mathbb Z_+$ and $S(X)$ be the set of the values $h^*(T)$ for all…
We establish a connection between linear codes and hyperplane arrangements using the Thomas decomposition of polynomial systems and the resulting counting polynomial. This yields both a generalization and a refinement of the weight…
We define a metric ultraproduct of topological groups with left-invariant metric, and show that there is a countable sequence of finite groups with left-invariant metric whose metric ultraproduct contains isometrically as a subgroup every…
A method of optimal control computation is proposed for problems with control and state constraints. It uses a sequence of control structure adjustments in the form of generations and reductions of nodes and arcs, which do not change the…
We show that every definable subset of an uncountably categorical pseudofinite structure has pseudofinite cardinality which is polynomial (over the rationals) in the size of any strongly minimal subset, with the degree of the polynomial…
We study Tao's finitary viewpoint of convergence in metric spaces, as captured by the notion of metastability. We adopt the perspective of continuous model theory. We show that, in essence, metastable convergence with a given rate is the…
We see how nested sequents, a natural generalisation of hypersequents, allow us to develop a systematic proof theory for modal logics. As opposed to other prominent formalisms, such as the display calculus and labelled sequents, nested…
The class $\mathcal{UP}$ of `ultimate polynomial time' problems over $\mathbb C$ is introduced; it contains the class $\mathcal P$ of polynomial time problems over $\mathbb C$. The $\tau$-Conjecture for polynomials implies that…