Related papers: Ruitenburg's Theorem Mechanized and Contextualized
In a recent paper, the author has shown how Interaction Graphs models for linear logic can be used to obtain implicit characterisations of non-deterministic complexity classes. In this paper, we show how this semantic approach to Implicit…
We suggest that the inner syntax of Quantum Mechanics is relational logic, a form of logic developed by C. S. Peirce during the years 1870 - 1880. The Peircean logic has the structure of category theory, with relation serving as an arrow…
The paper presents a solution to the long-standing question about the decidability of the two-variable fragment of the superintuitionistic predicate logic $\mathbf{QLC}$ defined by the class of linear Kripke frames, which is also the…
The purpose of this note is to explain the structure, general strategy, and main ideas of the proof in the work of Huang, McKenzie, and Yau (2024) on the Ramanujan property and edge universality of random regular graphs. The core of the…
In the same sense as classical logic is a formal theory of truth, the recently initiated approach called computability logic is a formal theory of computability. It understands (interactive) computational problems as games played by a…
The concept of turnpike connects the solution of long but finite time horizon optimal control problems with steady state optimal controls. A key ingredient of the analysis of the turnpike is the linear quadratic regulator problem and the…
We consider the Euler-Korteweg system with space periodic boundary conditions $ x \in \mathbb T^d $. We prove a local in time existence result of classical solutions for irrotational velocity fields requiring natural minimal regularity…
A subset $A$ of $\mathbb{N}$ is called an IP-set if $A$ contains all finite sums of distinct terms of some infinite sequence $(x_n)_{n\in \mathbb{N}} $ of natural numbers. Central sets, first introduced by Furstenberg using notions from…
We study the system IFP of intuitionistic fixed point logic, an extension of intuitionistic first-order logic by strictly positive inductive and coinductive definitions. We define a realizability interpretation of IFP and use it to extract…
Starting with a combinatorial partition theorem for words over an infinite alphabet dominated by a fixed sequence, established recently by the authors, we prove recurrence results for topological dynamical systems indexed by such words. In…
The goal of this note is to present Kaplansky's proof of the Regular Element Property and to explain how this argument can be adapted to the case of a coherent, strongly discrete and Noetherian (with an inductive definition of Noetherian)…
The predictability problem for systems with different characteristic time scales is investigated. It is shown that even in simple chaotic dynamical systems, the leading Lyapunov exponent is not sufficient to estimate the predictability…
We introduce Transductive Local Complexity (TLC) to extend the classical Local Rademacher Complexity (LRC) to the transductive setting, incorporating substantial and novel components. Although LRC has been used to obtain sharp…
The periodic tiling conjecture (PTC) asserts, for a finitely generated Abelian group $G$ and a finite subset $F$ of $G$, that if there is a set $A$ that solves the tiling equation $\mathbb{1}_F * \mathbb{1}_A = 1$, there is also a periodic…
One of quantum theory's salient features is its apparent indeterminism, i.e. measurement outcomes are typically probabilistic. We formally define and address whether this uncertainty is unavoidable or whether post-quantum theories can offer…
This paper investigates the contingency of logic within the framework of possible world semantics. Possible world semantics captures the meaning of necessitation, i.e., a statement is necessarily true if it holds in all possible worlds.…
We show that families of Instantaneous Quantum Polynomial (IQP) circuits corresponding to nontrivial Bell tests exhibit nonlocality. However, we also prove that this nonlocality can only be demonstrated using post-selection or nonlinear…
Although randomization has long been used in distributed computing, formal methods for reasoning about probabilistic concurrent programs have lagged behind. No existing program logics can express specifications about the full distributions…
A 1910 theorem of Brouwer characterizes the Cantor set as the unique totally disconnected, compact metric space without isolated points. A 1920 theorem of Sierpinski characterizes the rationals as the unique countable metric space without…
Let $(E)$ be a homogeneous linear differential equation Fuchsian of order $n$ over $\mathbb{P}^{1}(\mathbb{C}) $. The idea of Riemann (1857) was to obtain the properties of solutions of ($E$) by studying the local system. Thus, he obtained…