Related papers: Analytic computable structure theory and $L^p$ spa…

We give a characterization of $L^{p}(\sigma)$ for uniformly rectifiable measures $\sigma$ using Tolsa's $\alpha$-numbers, by showing, for $1<p<\infty$ and $f\in L^{p}(\sigma)$, that \[ \lVert f\rVert_{L^{p}(\sigma)}\sim…

We prove a number of elementary facts about computability in partial combinatory algebras (pca's). We disprove a suggestion made by Kreisel about using Friedberg numberings to construct extensional pca's. We then discuss separability and…

We investigate the computability-theoretic properties of valued fields, and in particular algebraically closed valued fields and $p$-adically closed valued fields. We give an effectiveness condition, related to Hensel's lemma, on a valued…

The usual examples of Bergman spaces consist of the closure of an algebra of holomorphic functions on a domain. One can also take the real part of such functions, but essentially one is looking at the same object. In this paper the author…

We show that $L^\infty(\mu)$, in its capacity as multiplication operators on $L^p(\mu)$, is minimal as a $p$-operator space for a decomposable measure $\mu$. We conclude that $L^1(\mu)$ has a certain maximal type $p$-operator space…

A model of computation is abstract if, when applied to any algebra, the resulting programs for computable functions and sets on that algebra are invariant under isomorphisms, and hence do not depend on a representation for the algebra.…

Let $(X,\omega)$ be a compact K\"ahler manifold of dimension $n$, and $\theta$ be a closed smooth real $(1,1)$-form representing a big and nef cohomology class. We introduce a metric $d_p, p\geq 1$, on the finite energy space…

Based on the projective matrix spaces studied by B. Schwarz and A. Zaks, we study the notion of projective space associated to a C*-algebra A with a fixed projection p. The resulting space P(p) admits a rich geometrical structure as a…

By combining well-known techniques from both noncommutative algebra and computational commutative algebra, we observe that an algorithmic approach can be applied to the study of irreducible representations of finitely presented algebras. In…

Generic computability has been studied in group theory and we now study it in the context of classical computability theory. A set A of natural numbers is generically computable if there is a partial computable function f whose domain has…

A general theme of computable structure theory is to investigate when structures have copies of a given complexity $\Gamma$. We discuss such problem for the case of equivalence structures and preorders. We show that there is a $\Pi^0_1$…

Let $X$ and $Y$ be Banach spaces and $(\Omega,\Sigma,\mu)$ a finite measure space. In this note we introduce the space $L^p[\mu;L(X,Y)]$ consisting of all (equivalence classes of) functions $\Phi:\Omega \mapsto L(X,Y)$ such that $\omega…

The usual definition of the set of constructible reals is $\Sigma ^1_2$. This set can have a simpler definition if, for example, it is countable or if every real is constructible. H. Friedman asked if the set of constructible reals can be…

We investigate the connection between measure, capacity and algorithmic randomness for the space of closed sets. For any computable measure m, a computable capacity T may be defined by letting T(Q) be the measure of the family of closed…

Let $p\in(1,\infty)\backslash\{2\}$. We show that every homomorphism from a $C^{*}$-algebra $\mathcal{A}$ into $B(l^{p}(J))$ satisfies a compactness property where $J$ is any set. As a consequence, we show that a $C^{*}$-algebra…

An observable on a quantum structure is any $\sigma$-homomorphism of quantum structures from the Borel $\sigma$-algebra into the quantum structure. We show that our partial information on an observable known only for all intervals of the…

Computable reducibility is a well-established notion that allows to compare the complexity of various equivalence relations over the natural numbers. We generalize computable reducibility by introducing degree spectra of reducibility and…

We investigate different notions of "computable topological base" for represented spaces. We show that several non-equivalent notions of bases become equivalent when we consider computably enumerable bases. This indicates the existence of a…

We consider the non-linear thermoelastic plate equation in rectangular domains $\Omega$. More precisely, $\Omega$ is considered to be given as the Cartesian product of whole or half spaces and a cube. First the linearized equation is…

A computable structure A is x-computably categorical for some Turing degree x, if for every computable structure B isomorphic to A there is an isomorphism f:B -> A with f computable in x. A degree x is a degree of categoricity if there is a…