Related papers: How incomputable is the separable Hahn-Banach theo…
One of the fundamental results in computability is the existence of well-defined functions that cannot be computed. In this paper we study the effects of data representation on computability; we show that, while for each possible way of…
We study complexity measures on subsets of the boolean hypercube and exhibit connections between algebra (the Hilbert function) and combinatorics (VC theory). These connections yield results in both directions. Our main complexity-theoretic…
We consider functions of natural numbers which allow a combinatorial interpretation as density functions (speed) of classes of relational structures, s uch as Fibonacci numbers, Bell numbers, Catalan numbers and the like. Many of these…
A model of computation for which reasonable yet still incomplete lower bounds are known is the read-once branching program. Here variants of complexity measures successful in the study of read-once branching programs are defined and…
These notes are dedicated to the study of the complexity of several classes of separable Banach spaces. We compute the complexity of the Banach-Saks property, the alternating Banach-Saks property, the complete continuous property, and the…
One of the elegant achievements in the history of proof theory is the characterization of the provably total recursive functions of an arithmetical theory by its proof-theoretic ordinal as a way to measure the time complexity of the…
A class of maps in a complex Banach space is studied, which includes both unbounded linear operators and nonlinear holomorphic maps. The defining property, which we call {\sl pseudo-contractivity}, is introduced by means of the Abel…
We study Basic Arithmetic, BA introduced by W. Ruitenburg. BA is an arithmetical theory based on basic logic which is weaker than intuitionistic logic. We show that the class of the provably total recursive functions of BA is a proper…
The notion of super weak compactness for subsets of Banach spaces is a strengthening of the weak compactness that can be described as a local version of super-reflexivity. A recent result of K. Tu which establishes that the closed convex…
We introduce a sheaf theoretic viewpoint on functional analysis designed for infinite dimensional Lie group actions. We develop functional calculus for Banach valued functors and, in particular, prove the existence of an exponential map for…
Recent advances in our understanding of higher derived limits carry multiple implications in the fields of condensed and pyknotic mathematics, as well as for the study of strong homology. These implications are thematically diverse,…
We consider the Lambek calculus, or non-commutative multiplicative intuitionistic linear logic, extended with iteration, or Kleene star, axiomatised by means of an $\omega$-rule, and prove that the derivability problem in this calculus is…
We give some reductions among problems in (nonnegative) weighted #CSP which restrict the class of functions that needs to be considered in computational complexity studies. Our reductions can be applied to both exact and approximate…
We use a way to extend partial combinatory algebras (pcas) by forcing them to represent certain functions. In the case of Scott's Graph model, equality is computable relative to the complement function. However, the converse is not true.…
This paper defines a new notion of bounded computable randomness for certain classes of sub-computable functions which lack a universal machine. In particular, we define such versions of randomness for primitive recursive functions and for…
We introduce the notion of finitary computable reducibility on equivalence relations on the natural numbers. This is a weakening of the usual notion of computable reducibility, and we show it to be distinct in several ways. In particular,…
The complexity of equivalence relations has received much attention in the recent literature. The main tool for such endeavour is the following reducibility: given equivalence relations $R$ and $S$ on natural numbers, $R$ is computably…
As a cornerstone of functional analysis, Hahn Banach theorem constitutes an indispensable tool of modern analysis where its impact extends beyond the frontiers of linear functional analysis into several other domains of mathematics,…
We compute the complexity, z-complexity, and support varieties of the (thick) Kac modules for the Lie superalgebras of type P. We also show the complexity and the z-complexity have geometric interpretations in terms of support and…
Kleene algebra (KA) is an important tool for reasoning about general program equivalences, with a decidable and complete equational theory. However, KA cannot always prove equivalences between specific programs. For this purpose, one adds…