Related papers: The Kraft--Barmpalias--Lewis-Pye lemma revisited
The sequence of $\alpha$-trimmings of empirical probabilities is shown to converge, in the Painlev\'{e}--Kuratowski sense, on the class of probability measures endowed with the weak topology, to the $\alpha$-trimming of the population…
We present and analyze a natural hierarchy of weak theories, develop analysis in them, and show that they are interpretable in bounded quantifier arithmetic $\text{I}\Delta_0$ (and hence in Robinson arithmetic Q). The strongest theories…
A type-2 computable real function is necessarily continuous; and this remains true for relative, i.e. oracle-based computations. Conversely, by the Weierstrass Approximation Theorem, every continuous f:[0,1]->R is computable relative to…
We introduce two notions of effective reducibility for set-theoretical statements, based on computability with Ordinal Turing Machines (OTMs), one of which resembles Turing reducibility while the other is modelled after Weihrauch…
A lemma stated by Ke Li in [arXiv:1208.1400] has been used in e.g. [arXiv:1510.04682,arXiv:1706.04590,arXiv:1612.01464,arXiv:1308.6503,arXiv:1602.08898] for various tasks in quantum hypothesis testing, data compression with quantum side…
In this article we consider linear operators satisfying a generalized commutation relation of a type of the Heisenberg-Lie algebra. It is proven that a generalized inequality of the Hardy's uncertainty principle lemma follows. Its…
In this paper, a new criterion is given to determine the $p-$rationality of some complex cubic number fields in terms of $ p-$divisibility of certain terms of a third-order recurrence sequence, several illustrated examples are…
We consider the classical Wiener-Ikehara Tauberian theorem, with a generalized condition of slow decrease and some additional poles on the boundary of convergence of the Laplace transform. In this generality, we prove the otherwise known…
We give a new simple proof of the decidability of the First Order Theory of (omega^omega^i,+) and the Monadic Second Order Theory of (omega^i,<), improving the complexity in both cases. Our algorithm is based on tree automata and a new…
We revisit a technique of S. Lehr on automata and use it to prove old and new results in a simple way. We give a very simple proof of the 1986 theorem of Honkala that it is decidable whether a given k-automatic sequence is ultimately…
We prove a variant of the abstract probabilistic version of Szemer\'edi's regularity lemma, due to Tao, which applies to a number of structures (including graphs, hypergraphs, hypercubes, graphons, and many more) and works for random…
As an analog to the Jacquet-Rallis fundamental lemma that appears in the relative trace formula approach to the Gan-Gross-Prasad conjectures, the arithmetic fundamental lemma was proposed by Wei Zhang and used in an approach to the…
We develop techniques to investigate relativized hierarchical unambiguous computation. We apply our techniques to generalize known constructs involving relativized unambiguity based complexity classes (UP and \mathcal{UP}) to new constructs…
It is known [DemriSchnoebelen02] that both satisfiability and model-checking problems for propositional Linear-time Temporal Logic, LTL, with only a single propositional variable in the language are PSPACE-complete, which coincides with the…
We set up a general context in which one can prove Sauer-Shelah type lemmas. We apply our general results to answer a question of Bhaskar and give a slight improvement to a result of Malliaris and Terry. We also prove a new Sauer-Shelah…
We consider the general framework of perturbative quantum field theory for the pure Yang-Mills model. We give a more precise version of the Wick theorem using Hopf algebra notations for chronological products and not for Feynman graphs.…
This paper explores the connection between two central results in the proof theory of classical logic: Gentzen's cut-elimination for the sequent calculus and Herbrands "fundamental theorem". Starting from Miller's expansion-tree-proofs, a…
We introduce the logics GLP(\Lambda), a generalization of Japaridze's polymodal provability logic GLP(\omega) where \Lambda is any linearly ordered set representing a hierarchy of provability operators of increasing strength. We shall…
We generalize the feasible interpolation theorem for semantic derivations from K.(1997) by allowing randomized protocols (protocols in the sense of K.(1997). We also introduce an extension of the monotone circuit model, monotone circuits…
We introduce a sequent calculus with a simple restriction of Lambek's product rules that precisely captures the classical Tamari order, i.e., the partial order on fully-bracketed words (equivalently, binary trees) induced by a…