Related papers: Open induction in a bounded arithmetic for TC^0
Continuing the study of complexity theory of Koepke's Ordinal Turing Machines (OTMs) that was started by Rin, L\"owe and the author, we prove the following results: (1) An analogue of Ladner's theorem for OTMs holds: That is, there are…
We define a C*-hull for a *-algebra, given a notion of integrability for its representations on Hilbert modules. We establish a local-global principle which, in many cases, characterises integrable representations on Hilbert modules through…
The literature contains interesting examples of inclusions of simple C$^*$-algebras with the property that all intermediate C$^*$-algebras likewise are simple. In this article we take up a systematic study of such inclusions, which we refer…
We give an exposition of an iteration theorem for iterating $(<\lambda)$-closed stationary $\lambda^+$-cc forcing with supports of size $<\lambda$ and preserving these two properties. We discuss the relation of this theorem with other…
We solve the following algorithmic problems using TC0 circuits, or in logspace and quasilinear time, uniformly in the class of nilpotent groups with bounded nilpotency class and rank: subgroup conjugacy, computing the normalizer and…
We show that the class of unital $\mathrm{C}^*$-algebras is an elementary class in the language of operator systems. As a result, we have that there is a definable predicate in the language of operator systems that defines the…
One of the prominent current challenges in complexity theory is the attempt to prove lower bounds for $TC^0$, the class of constant-depth, polynomial-size circuits with majority gates. Relying on the results of Williams (2013), an appealing…
We study C*-irreducibility of inclusions of reduced twisted group C*-algebras and of reduced group C*-algebras. We characterize C*-irreducibility in the case of an inclusion arising from a normal subgroup, and exhibit many new examples of…
We consider linear cost-register automata (equivalent to weighted automata) over the semiring of nonnegative rationals, which generalise probabilistic automata. The two problems of boundedness and zero isolation ask whether there is a…
The rational and C_2-cofinite simple vertex operator algebras whose effective central charges and the central charges c are equal and less than 1 are classified. Such a vertex operator algebra is zero if c<0 and C if c=0. If c>0, it is an…
In this paper we present the first-ever computer formalization of the theory of Gr\"obner bases in reduction rings, which is an important theory in computational commutative algebra, in Theorema. Not only the formalization, but also the…
We show the equivalence between the existence of winning strategies for $G_{\delta \sigma}$ (also called $\Sigma^{0}_{3}$) games in Cantor or Baire space, and the existence of functions generalized-recursive in a higher type-2 functional.…
Functional analysis, especially the theory of Hilbert spaces and of operators on these, form an important area in mathematics. We formalized the Isabelle/HOL library Complex_Bounded_Operators containing a large amount of theorems about…
Based on operators borrowed from scattering theory, several concrete realizations of index theorems are proposed. The corresponding operators belong to some C*-algebras of pseudo-differential operators with coefficients which either have…
We introduce an operational rewriting-based semantics for strictly positive nested higher-order (co)inductive types. The semantics takes into account the "limits" of infinite reduction sequences. This may be seen as a refinement and…
Motivated by questions like: which spatial structures may be characterized by means of modal logic, what is the logic of space, how to encode in modal logic different geometric relations, topological logic provides a framework for studying…
Let $H$ be a separable Hilbert space with a fixed orthonormal basis. Let $\mathbb B^{(k)}(H)$ denote the set of operators, whose matrices have no more than $k$ non-zero entries in each line and in each column. The closure of the union (over…
We prove that the gcd of certain infinite number of integers associated to generalised arithmetic progressions remains bounded independent of the progression. Using this we also get bounds on the indices of certain congruence subgroups of…
The class of uniformly computable real functions with respect to a small subrecursive class of operators computes the elementary functions of calculus, restricted to compact subsets of their domains. The class of conditionally computable…
A proof system for a language L is a function f such that Range(f) is exactly L. In this paper, we look at proofsystems from a circuit complexity point of view and study proof systems that are computationally very restricted. The…