Related papers: How incomputable is the separable Hahn-Banach theo…
This Paper investigate sequent calculi for certain weak subintuitionistic logics. We establish that weakening and contraction are height-preserving admissible for each of these calculi, and we provide a syntactic proof for the admissibility…
This article expands our work in [Ca16]. By its reliance on Turing computability, the classical theory of effectivity, along with effective reducibility and Weihrauch reducibility, is only applicable to objects that are either countable or…
We present a simplified and streamlined characterisation of provably total computable functions of the theory ID_1 of non-iterated inductive definitions. The idea of the simplification is to employ the method of operator-controlled…
We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which…
We study the complexity of the classification problem for countable models of set theory (ZFC). We prove that the classification of arbitrary countable models of ZFC is Borel complete, meaning that it is as complex as it can conceivably be.…
We investigate certain envelopes of open sets in dual Banach spaces which are related to extending holomorphic functions. We give a variety of examples of absolutely convex sets showing that the extension is in many cases not possible. We…
We propose an AC-independent proof of the existence of a non-measurable set as a consequence of the Hahn-Banach theorem of functional analysis which is known to be strictly weaker than AC.
We review the multivariate holomorphic functional calculus for tuples in a commutative Banach algebra and establish a simple "na\"ive" extension to commuting tuples in a general Banach algebra. The approach is na\"ive in the sense that the…
For an arbitrary infinite-dimensional Banach space $\X$, we construct examples of strongly-measurable $\X$-valued Pettis integrable functions whose indefinite Pettis integrals are nowhere weakly differentiable; thus, for these functions the…
In this paper we present another proof of the analytic version of the Hahn-Banach theorem in terms of convex functionals.
We investigate the behavior of functional countability and exponential separability in products and subspaces of topological spaces. We solve a problem of Tkachuk by showing that the product of functionally countable pseudocompact spaces is…
An important tool in the study of the complexity of Constraint Satisfaction Problems (CSPs) is the notion of a relational clone, which is the set of all relations expressible using primitive positive formulas over a particular set of base…
We revisit the question (most famously) initiated by Turing: can human intelligence be completely modeled by a Turing machine? We show that the answer is \emph{no}, assuming a certain weak soundness hypothesis. More specifically we show…
We prove a commutative Gelfand--Naimark type theorem, by showing that the set $C_s(X)$ of continuous bounded (real or complex valued) functions with separable support on a locally separable metrizable space $X$ (provided with the supremum…
In a previous work, we developed an algorithm for the computation of incomplete Bessel functions, which pose as a numerical challenge, based on the $G_{n}^{(1)}$ transformation and Slevinsky-Safouhi formula for differentiation. In the…
This survey aims to highlight some of the consequences that representable (and continuous) functionals have in the framework of Banach quasi *-algebras. In particular, we look at the link between the notions of *-semisimplicity and full…
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…
For substructural logics with contraction or weakening admitting cut-free sequent calculi, proof search was analyzed using well-quasi-orders on $\mathbb{N}^d$ (Dickson's lemma), yielding Ackermannian upper bounds via controlled bad-sequence…
We characterize Weihrauch reducibility in E-PA$^{\omega}$ + QF-AC$^{0,0}$ and all systems containing it by the provability in a linear variant of the same calculus using modifications of G\"odel's Dialectica interpretation that incorporate…
A binary relation on graphs is recursively enumerable if and only if it can be computed by a formula in monadic second-order logic. The latter means that the formula defines a set of graphs, in the usual way, such that each "computation…