Related papers: Arithmetical and Hyperarithmetical Worm Battles

We examine the theoretical properties of enforcing priors provided by generative deep neural networks via empirical risk minimization. In particular we consider two models, one in which the task is to invert a generative neural network…

G\"odel's Dialectica interpretation was designed to obtain a relative consistency proof for Heyting arithmetic, to be used in conjunction with the double negation interpretation to obtain the consistency of Peano arithmetic. In recent…

Adversarial computations are a widely studied class of computations where resource-bounded probabilistic adversaries have access to oracles, i.e., probabilistic procedures with private state. These computations arise routinely in several…

We prove a pointwise ergodic theorem for quasi-probability-measure-preserving (quasi-pmp) locally countable measurable graphs, equivalently, Schreier graphs of quasi-pmp actions of countable groups. For ergodic graphs, the theorem gives an…

We present a proof-theoretic analysis of the logic NL$\lambda$ (Barker \& Shan 2014, Barker 2019). We notably introduce a novel calculus of proof nets and prove it is sound and complete with respect to the sequent calculus for the logic. We…

A formalism of arithmetic partial differential equations (PDEs) is being developed in which one considers several arithmetic differentiations at one fixed prime. In this theory solutions can be defined in algebraically closed p-adic fields.…

We obtain new results pertaining to convergence and recurrence of multiple ergodic averages along functions from a Hardy field. Among other things, we confirm some of the conjectures posed by Frantzikinakis in [Fra10; Fra16] and obtain…

We conjecture that bounded generalised polynomial functions cannot be generated by finite automata, except for the trivial case when they are ultimately periodic. Using methods from ergodic theory, we are able to partially resolve this…

An approach to build Probabilistic Arithmetic in which initial values of all correlated random variables are known, but with varying degrees of accuracy. As a result of the proposed Probabilistic Arithmetic operations, variable values,…

We consider decision problems for deterministic pushdown automata over a unary alphabet (udpda, for short). Udpda are a simple computation model that accept exactly the unary regular languages, but can be exponentially more succinct than…

Formal theories of arithmetic have traditionally been based on either classical or intuitionistic logic, leading to the development of Peano and Heyting arithmetic, respectively. We propose to use $\mu$MALL as a formal theory of arithmetic…

We prove a rigidity property in non-Archimedean dynamics, reminiscent of Zdunik theorem in complex dynamics: every rational map whose equilibrium measure charges an interval in the Berkovich projective line is affine Bernoulli. Our proof is…

Let $X$ be a finite set and $\Omega=\{1,...,d\}^{\mathbb{N}}$ be the Bernoulli space. Denote by $\sigma$ the shift map acting on $\Omega$. For a fixed probability $\mu$ on $X$ with supp($\mu$)$=X$, define $\Pi(\mu,\sigma)$ as the set of all…

The Weighted Path Order of Yamada is a powerful technique for proving termination. It is also supported by CeTA, a certifier for checking untrusted termination proofs. To be more precise, CeTA contains a verified function that computes for…

We show that the first-order theory of Sturmian words over Presburger arithmetic is decidable. Using a general adder recognizing addition in Ostrowski numeration systems by Baranwal, Schaeffer and Shallit, we prove that the first-order…

Many classical theorems in combinatorics establish the emergence of substructures within sufficiently large collections of objects. Well-known examples are Ramsey's theorem on monochromatic subgraphs and the Erd\H{o}s-Rado sunflower lemma.…

We establish results with an arithmetic flavor that generalize the polynomial multidimensional Szemeredi theorem and related multiple recurrence and convergence results in ergodic theory. For instance, we show that in all these statements…

The assumption that voters' preferences share some common structure is a standard way to circumvent NP-hardness results in social choice problems. While the Kemeny ranking problem is NP-hard in the general case, it is known to become easy…

We introduce a new benchmark problem called Deceptive Leading Blocks (DLB) to rigorously study the runtime of the Univariate Marginal Distribution Algorithm (UMDA) in the presence of epistasis and deception. We show that simple Evolutionary…

Adjoint logic is a general approach to combining multiple logics with different structural properties, including linear, affine, strict, and (ordinary) intuitionistic logics, where each proposition has an intrinsic mode of truth. It has…