Related papers: On Use of an Explicit Congruence Predicate in Boun…
We study extensions of Sem\"enov arithmetic, the first-order theory of the structure $(\mathbb{N}, +, 2^x)$. It is well-knonw that this theory becomes undecidable when extended with regular predicates over tuples of number strings, such as…
Let $n$ and $r$ be positive integers. Define the numbers $S_n^{(r)}$ by $S_n^{(r)}=\sum_{k=0}^n\binom{n}{k}^2\binom{2k}{k}(2k+1)^r.$ In this paper we prove some conjectures of Guo and Liu which extend some conjectures of Z.-W. Sun…
We prove explicit bounds on the radius of a ball centered at the origin which is guaranteed to contain all bounded connected components of a semi-algebraic set $S \subset \mathbbm{R}^k$ defined by a quantifier-free formula involving $s$…
We classify minimal finite models of the M\"{o}bius band and several wedge sums of spheres. In particular, we show that the minimal finite model of the M\"{o}bius band coincides with that of the circle $S^{1}$. Furthermore, we prove that…
In this paper we obtain bounds on $h^0(E)$ where $E$ is a semistable bundle of rank 3 over a smooth irreducible projective curve $X$ of genus $g \geq 2$ defined over an algebraically closed field of characteristic 0. These bounds are…
We describe an algorithmic method of proof compression based on the introduction of Pi_2-cuts into a cut-free LK-proof. The current approach is based on an inversion of Gentzen s cut-elimination method and extends former methods for…
In this paper, we show how to construct for a given consistent theory $U$ a $\Sigma^0_1$-predicate that both satisfies the L\"ob Conditions and the Kreisel Condition ---even if $U$ is unsound. We do this in such a way that $U$ itself can…
Frege's theorem says that second-order Peano arithmetic is interpretable in Hume's Principle and full impredicative comprehension. Hume's Principle is one example of an abstraction principle, while another paradigmatic example is Basic Law…
The elementary arithmetic operations $+,\cdot,\le$ on integers are well-known to be computable in the weak complexity class $\mathrm{TC}^0$, and it is a basic question what properties of these operations can be proved using only…
For a finite point set $E\subset \mathbb{R}^d$ and a connected graph $G$ on $k+1$ vertices, we define a $G$-framework to be a collection of $k + 1$ points in E such that the distance between a pair of points is specified if the…
We study truncated Bose operators in finite dimensional Hilbert spaces. Spin coherent states for the truncated Bose operators and canonical coherent states for Bose operators are compared. The Lie algebra structure and the spectrum of the…
The motivation for this paper is to study the complexity of constant-width arithmetic circuits. Our main results are the following. 1. For every k > 1, we provide an explicit polynomial that can be computed by a linear-sized monotone…
The regular languages with a neutral letter expressible in first-order logic with one alternation are characterized. Specifically, it is shown that if an arbitrary $\Sigma_2$ formula defines a regular language with a neutral letter, then…
Given a $\Pi^{\mu}_2$ formula of the modal $\mu$ calculus, it is decidable whether it is equivalent to a $\Sigma^{\mu}_2$ formula.
There have been many generalizations of Shoenfield's Theorem on the absoluteness of $\Sigma^1_2$ sentences between uncountable transitive models of $\mathrm{ZFC}$. One of the strongest versions currently known deals with $\Sigma^2_1$…
This paper considers the computational hardness of computing expected outcomes and deciding almost-sure termination of probabilistic programs. We show that deciding almost-sure termination and deciding whether the expected outcome of a…
We define an algebra of contravariant symbols on $S^2$ and give an algebraic proof of the Correspondence Principle for that algebra.
We show that for any two distinct words $ s_1, s_2 $ over an arbitrary alphabets, there exists a deterministic finite automaton with $ O(\log^2 n) $ states that accepts $ s_1 $ and rejects $ s_2 $. This improves the previous upper bound of…
End-to-end (E2E) models are becoming increasingly popular for spoken language understanding (SLU) systems and are beginning to achieve competitive performance to pipeline-based approaches. However, recent work has shown that these models…
In this paper we prove a quantitative form of the strong unique continuation property for the Lam\'e system when the Lam\'e coefficients $\mu$ is Lipschitz and $\lambda$ is essentially bounded in dimension $n\ge 2$. This result is an…