Related papers: The Omega Rule is $\mathbf{\Pi_{1}^{1}}$-Complete …

Let $A,B\in \mathbb{B}(\mathscr{H})$ be such that $0<b_{1}I \leq A \leq a_{1}I$ and $0<b_{2}I \leq B \leq a_{2}I$ for some scalars $0<b_{i}< a_{i},\;\; i=1,2$ and $\Phi:\mathbb{B}(\mathscr{H})\rightarrow\mathbb{B}(\mathscr{K})$ be a…

The formal system lambda-delta is a typed lambda calculus that pursues the unification of terms, types, environments and contexts as the main goal. lambda-delta takes some features from the Automath-related lambda calculi and some from the…

Given a bounded open set $\Omega\subset \mathbb{R}^n$, we study sequences of quadratic functionals on the Sobolev space $H^1_0(\Omega)$, perturbed by sequences of bounded linear functionals. We prove that their $\Gamma$-limits, in the weak…

This article describes a Turing machine which can solve for $\beta^{'}$ which is RE-complete. RE-complete problems are proven to be undecidable by Turing's accepted proof on the Entscheidungsproblem. Thus, constructing a machine which…

We prove that if the linear-time and polynomial-time hierarchies coincide, then every model of $\Pi_1(\mathbb{N}) + \neg \Omega_1$ has a proper end-extension to a model of $\Pi_1(\mathbb{N})$, and so $\Pi_1(\mathbb{N}) + \neg \Omega_1…

We combine the fixed-order evaluation of the $b\bar{b}$ sum rules with a non-relativistic effective-theory approach. The combined result for the $n$-th moment includes all terms suppressed with respect to the leading-order result by ${\cal…

This paper provides two extensions of first order logic by `$\omega$-rules'. In each case we characterize the countable structures whose theory in the logic is categorical (has a unique model). In the one-sorted inferential $\omega$-logic,…

We show that for a fixed integer $n \neq \pm2$, the congruence $x^2 + nx \pm 1 \equiv 0 \pmod{\alpha}$ has the solution $\beta$ with $0 < \beta < \alpha$ if and only if $\alpha/\beta$ has a continued fraction expansion with sequence of…

We propose a quantum programming language that generalizes the $\lambda$-calculus. The language is non-linear; duplicated variables denote, not cloning of quantum data, but sharing a qubit's state; that is, producing an entangled pair of…

Among other things, we prove that, for a doubling weight $w$, $0< p\leq\infty$, $r\in{\mathbb N}_0$, and $0<\alpha <r+1 - 1/\lambda_p$, we have \[ E_n(f)_{p, w_n} = O(n^{-\alpha}) \iff \omega_\varphi^{r+1}(f, n^{-1})_{p, w_n} =…

If $n \ge 3$, $q>2$ and $\beta > 0$ then the function $\exp(-(|x_1|^q+|x_2|^q+\dots+|x_n|^q)^{\beta/q})$\ is not positive definite. This result gives an answer to a question posed by I.J.~Schoenberg in 1938. This text is an authorized…

The role of the Equivalence Principle (EP) in classical and quantum mechanics is reviewed. It is shown that the weak EP has a counterpart in quantum theory, a Quantum Equivalence Principle (QEP). This implies that also in the quantum domain…

We prove that orthogonal constructor term rewrite systems and lambda-calculus with weak (i.e., no reduction is allowed under the scope of a lambda-abstraction) call-by-value reduction can simulate each other with a linear overhead. In…

A permutation group $G\le\operatorname{Sym}(\Omega)$ is said to be $2$-closed if no group $H$ such that $G<H\le\operatorname{Sym}(\Omega)$ has the same orbits on $\Omega\times\Omega$ as $G$. A simple and efficient inductive criterion for…

The celebrated Trakhtenbrot's theorem states that the set of finitely valid sentences of first-order logic is not computably enumerable. In this note we will extend this theorem by proving that the finite satisfiability problem of any…

We show that many principles of first-order arithmetic, previously only known to lie strictly between $\Sigma_1$-induction and $\Sigma_2$-induction, are equivalent to the well-foundedness of $\omega^\omega$. Among these principles are the…

Whether the class QMA (Quantum Merlin Arthur) is equal to QMA1, or QMA with one-sided error, has been an open problem for years. This note helps to explain why the problem is difficult, by using ideas from real analysis to give a "quantum…

Let $\Omega\subset\mathbb{R}^{N}$ ($N\geq1$) be a smooth bounded domain, $a\in C(\bar{\Omega})$ a sign-changing function, and $0\leq q<1$. We investigate the Robin problem \[ \begin{cases} -\Delta u=a(x)u^{q} & \mbox{in $\Omega$},\\ u\geq0…

For $\Omega\subseteq\mathbb{R}^{n}$ an open and bounded region we consider solutions $u\in W_{\text{loc}}^{1,p(x)}\big(\Omega;\mathbb{R}^{N}\big)$, with $N>1$, of the $p(x)$-Laplacian system \begin{equation}…

Let $n\ge 2$ and $s\in (n-2,n)$. Assume that $\Omega\subset \mathbb{R}^n$ is a one-sided bounded non-tangentially accessible domain with $s$-Ahlfors regular boundary and $\sigma$ is the surface measure on the boundary of $\Omega$, denoted…