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

Let $\msp$ be a measure space and let $1 < p < \infty$. The {\em weak $L^p$}\/ space $\wlp$ consists of all measurable functions $f$ such that \[ \|f\| = \sup_{t>0}t^{\frac{1}{p}}f^*(t) < \infty,\] where $f^*$ is the decreasing…

Very recently, \v{S}pakula and Tikuisis provide a new characterisation of (uniform) Roe algebras via quasi-locality when the underlying metric spaces have straight finite decomposition complexity. In this paper, we improve their method to…

A construction of the noncommutative-geometric counterparts of classical classifying spaces is presented, for general compact matrix quantum structure groups. A quantum analogue of the classical concept of the classifying map is introduced…

We construct a large collection of "quantum projective spaces", in the form of Koszul, Calabi-Yau algebras with the Hilbert series of a polynomial ring. We do so by starting with the toric ones (the q-symmetric algebras), and then deforming…

First, we classify proper biharmonic Hopf real hypersurfaces in $\mathbb{C}P^2$. Next, we classify proper biharmonic real hypersurfaces with two distinct principal curvatures in $\mathbb{C}P^n$, where $n\geq 2$. Finally, we prove that…

We explore the possibility of extending Mardare et al. quantitative algebras to the structures which naturally emerge from Combinatory Logic and the lambda-calculus. First of all, we show that the framework is indeed applicable to those…

This is Part II in our multi-part series of papers developing the theory of a subclass of locally compact quantum groupoids ("quantum groupoids of separable type"), based on the purely algebraic notion of weak multiplier Hopf algebras. The…

Quantum algorithms are sequences of abstract operations, performed on non-existent computers. They are in obvious need of categorical semantics. We present some steps in this direction, following earlier contributions of Abramsky, Coecke…

This paper investigates the effective categoricity of ultrahomogeneous structures. It is shown that any computable ultrahomogeneous structure is $\Delta^0_2$ categorical. A structure A is said to be weakly ultrahomogeneous if there is a…

In this paper, a new invariant was built towards the classification of separable C*-algebras of real rank zero, which we call latticed total K-theory. A classification theorem is given in terms of such an invariant for a large class of…

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…

We survey and expand on the work of Segal, Milgram and the author on the topology of spaces of maps of positive genus curves into $n$-th complex projective space, $n\geq 1$ (in both the holomorphic and continuous categories). Both based and…

This paper introduces abstractions that are meaningful for computers and that can be built and used according to computers' own criteria, i.e., computable abstractions. It is analyzed how abstractions can be seen to serve as the building…

We study a series of real nonassociative algebras $\mathbb{O}_{p,q}$ introduced in $[5]$. These algebras have a natural $\mathbb{Z}_2^n$-grading, where $n=p+q$, and they are characterized by a cubic form over the field $\mathbb{Z}_2$. We…

In this paper is discussed description of some algebraic structures in quantum theory by using formal recursive constructions with "complex Poincar\'e group" ISO(4,C).

We initiate the computability-theoretic study of ringed spaces and schemes. In particular, we show that any Turing degree may occur as the least degree of an isomorphic copy of a structure of these kinds. We also show that these structures…

We investigate the computability of algebraic closure and definable closure with respect to a collection of formulas. We show that for a computable collection of formulas of quantifier rank at most $n$, in any given computable structure,…

In the same sense as classical logic is a formal theory of truth, the recently initiated approach called computability logic is a formal theory of computability. It understands (interactive) computational problems as games played by a…

This paper develops a technical and practical reinterpretation of the real interval [a,b] under the paradigm of fractal countability. Instead of assuming the continuum as a completed uncountable totality, we model [a,b] as a layered…

We give new characterizations of spaces $X$ which are $k_\mathbb{R}$-spaces or $s_\mathbb{R}$-spaces. Applying the obtained results we provide some sufficient and necessary conditions on $X$ for which $C_p(X)$ is a $k_\mathbb{R}$-space or…