Related papers: The Limit of Recursion in State-based Systems
We present a framework for upper bounding the number of iterations required by first-order optimization algorithms implementing constrained LQR controllers. We derive new bounds for the condition number and extremal eigenvalues of the…
We construct a class of nonnegative martingale processes that oscillate indefinitely with high probability. For these processes, we state a uniform rate of the number of oscillations and show that this rate is asymptotically close to the…
Many nonlinear optimal control and optimization problems involve constraints that combine continuous dynamics with discrete logic conditions. Standard approaches typically rely on mixed-integer programming, which introduces scalability…
For a continuous map $T$ of a compact metrizable space $X$ with finite topological entropy, the order of accumulation of entropy of $T$ is a countable ordinal that arises in the context of entropy structure and symbolic extensions. We show…
We study the decidability and expressiveness issues of $\mu$-calculus on data words and data $\omega$-words. It is shown that the full logic as well as the fragment which uses only the least fixpoints are undecidable, while the fragment…
We propose a novel second-order ODE as the continuous-time limit of a Riemannian accelerated gradient-based method on a manifold with curvature bounded from below. This ODE can be seen as a generalization of the ODE derived for Euclidean…
We show that that a certain class of semi-proper iterations does not add omega-sequences. As a result, starting from suitable large cardinals one can obtain a model in which the Continuum Hypothesis holds and every function from omega_1 to…
We study the strength of axioms needed to prove various results related to automata on infinite words and B\"uchi's theorem on the decidability of the MSO theory of $(N, {\le})$. We prove that the following are equivalent over the weak…
We study the model-checking problem for recursion schemes: does the tree generated by a given higher-order recursion scheme satisfy a given logical sentence. The problem is known to be decidable for sentences of the MSO logic. We prove…
First-order model counting (FOMC) is a computational problem that asks to count the models of a sentence in finite-domain first-order logic. In this paper, we argue that the capabilities of FOMC algorithms to date are limited by their…
The use of a necessity modality in a typed $\lambda$-calculus can be used to separate it into two regions. These can be thought of as intensional vs. extensional data: data in the first region, the modal one, are available as code, and…
We establish a generic upper bound ExpTime for reasoning with global assumptions (also known as TBoxes) in coalgebraic modal logics. Unlike earlier results of this kind, our bound does not require a tractable set of tableau rules for the…
In many iterative optimization methods, fixed-point theory enables the analysis of the convergence rate via the contraction factor associated with the linear approximation of the fixed-point operator. While this factor characterizes the…
We introduce a new method for building models of CH, together with $\Pi_2$ statements over $H(\omega_2)$, by forcing. Unlike other forcing constructions in the literature, our construction adds new reals, although only $\aleph_1$-many of…
We provide a sufficient geometric condition for $\mathbb{R}^n$ to be countably $(\mu,m)$ rectifiable of class $\mathscr{C}^{1,\alpha}$ (using the terminology of Federer), where $\mu$ is a Radon measure having positive lower density and…
We design a new feedback law to stabilize a linear infinite-dimensional control system, where the state operator generates a C0-group and the control operator is unbounded. Our feedback law is based on the integration of a mutated Gramian…
We develop a discipline-agnostic emergence calculus that treats theories as fixed points of idempotent operators acting on descriptions. We show that, once processes are composable but access to the underlying system is mediated by a…
In 1979 Schwichtenberg showed that the System $\text{T}$ definable functionals are closed under a rule-like version Spector's bar recursion of lowest type levels $0$ and $1$. More precisely, if the functional $Y$ which controls the stopping…
We deal with the fragment of modal logic consisting of implications of formulas built up from the variables and the constant `true' by conjunction and diamonds only. The weaker language allows one to interpret the diamonds as the uniform…
In this paper we give an ordinal analysis of the theory of second order arithmetic. We do this by working with proof trees -- that is, "deductions" which may not be well-founded. Working in a suitable theory, we are able to represent…