Related papers: Open induction in a bounded arithmetic for TC^0
In a recently launched research program for developing logic as a formal theory of (interactive) computability, several very interesting logics have been introduced and axiomatized. These fragments of the larger Computability Logic aim not…
We consider the complexity (in terms of the arithmetical hierarchy) of the various quantifier levels of the diagram of a computably presented metric structure. As the truth value of a sentence of continuous logic may be any real in $[0,1]$,…
We present a constructive method to create quantum circuits that implement oracles $|x\rangle|y\rangle|0\rangle^k \mapsto |x\rangle|y \oplus f(x)\rangle|0\rangle^k$ for $n$-variable Boolean functions $f$ with low $T$-count. In our method…
We define a hierarchy of circuit complexity classes LD^i, whose depth are the inverse of a function in Ackermann hierarchy. Then we introduce extremely weak versions of length induction and construct a bounded arithmetic theory L^i_2 whose…
The regular open subsets of a topological space form a Boolean algebra, where the `join' of two regular open sets is the interior of the closure of their union. A `credence' is a finitely additive probability measure on this Boolean…
Let $L(s)=\sum_{n=1}^{+\infty}\dfrac{a(n)}{n^s}$ be a Dirichlet series were $a(n)$ is a bounded completely multiplicative function. We prove that if $L(s)$ extends to a holomorphic function on the open half space $\Re s >1-\delta$,…
For any $q > 1$, let $\MOD_q$ be a quantum gate that determines if the number of 1's in the input is divisible by $q$. We show that for any $q,t > 1$, $\MOD_q$ is equivalent to $\MOD_t$ (up to constant depth). Based on the case $q=2$, Moore…
We introduce a notion of a noncommutative function defined on a domain of $d$-tuples of bounded operators on an infinite dimensional Hilbert space. Inverse and implicit function theorems in this setting are established. When these…
The article explores the arithmetic of multiplication as a model of many valued projective logic. It is demonstrated that closed numerical intervals within this framework constitute Heyting algebras. The conditions for these algebras to be…
Quantum algorithms are a very promising field. However, creating and manipulating these kind of algorithms is a very complex task, specially for software engineers used to work at higher abstraction levels. The work presented here is part…
Let $\mathcal{M}$ be a semifinite von Neumann algebra on a Hilbert space $\mathcal{H}$ equipped with a faithful normal semifinite trace $\tau$, $S(\mathcal{M},\tau)$ be the ${}^*$-algebra of all $\tau$-measurable operators. Let…
We give a reframing of Godel's first and second incompleteness theorems that applies even to some undefinable theories of arithmetic. The usual Hilbert-Bernays provability conditions and the diagonal lemma are replaced by a more direct…
Considering the deeper reasons of the appearance of a remarkable counterexample by J.~Kaad and M.~Skeide [17] we consider situations in which two Hilbert C*-modules $M \subset N$ with $M^\bot = \{ 0 \}$ over a fixed C*-algebra $A$ of…
Implicit computational complexity, which aims at characterizing complexity classes by machine-independent means, has traditionally been based, on the one hand, on programs and deductive formalisms for free algebras, and on the other hand on…
We introduce the Mixed-Integer Quadratically Constrained Quadratic Programming framework for the quantum compilation problem and apply it in the context of topological quantum computing. In this setting, quantum gates are realized by…
We propose a framework for reasoning about programs that manipulate coinductive data as well as inductive data. Our approach is based on using equational programs, which support a seamless combination of computation and reasoning, and using…
We investigate the special class of formulas made up of arbitrary but finite com- binations of addition, multiplication, and exponentiation gates. The inputs to these formulas are restricted to the integral unit 1. In connection with such…
Turing's famous 'machine' framework provides an intuitively clear conception of 'computing with real numbers'. A recursive counterexample to a theorem shows that the theorem does not hold when restricted to computable objects. These…
In this paper, we are mainly concerned with studying arbitrary unbounded square roots of linear operators as well as some of their basic properties. The paper contains many examples and counterexamples. As an illustration, we give explicit…
We construct some inverse-closed algebras of bounded integral operators with operator-valued kernels, acting in spaces of vector-valued functions on locally compact groups. To this end we make systematic use of covariance algebras…