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

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,…

We construct examples of weighted algebras $L_p^w(G)$ with $1<p\le 2$ on uncountable free groups. For $p>2$ no weighted algebras exist on these groups. From the other side, we prove that an amenable group on which exist weighted algebras…

We give a characterization of the strong degrees of categoricity of computable structures greater or equal to $\mathbf 0''$. They are precisely the \emph{treeable} degrees -- the least degrees of paths through computable trees -- that…

It is studied a connection between the separability and the countable chain condition of spaces with the $L$-property (a topological space $X$ has the $L$-property if for every topological space $Y$, separately continuous function…

Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical computable model theory is used to examine the algorithmic structure of…

We present a complete characterization of the metric compactification of $L_{p}$ spaces for $1\leq p < \infty$. Each element of the metric compactification of $L_{p}$ is represented by a random measure on a certain Polish space. By way of…

Metrizable spaces are studied in which every closed set is an $\alpha$-limit set for some continuous map and some point. It is shown that this property is enjoyed by every space containing sufficiently many arcs (formalized in the notion of…

The empty set of course contains no computable point. On the other hand, surprising results due to Zaslavskii, Tseitin, Kreisel, and Lacombe assert the existence of NON-empty co-r.e. closed sets devoid of computable points: sets which are…

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…

A cohesive power of a structure is an effective analog of the classical ultrapower of a structure. We start with a computable structure, and consider its countable ultrapower over a cohesive set of natural numbers. A cohesive set is an…

Let $\Omega$ be a symmetric cone. In this note, we introduce the Hilbert projective metric on $\Omega$ in terms of Jordan algebras and we apply it to prove that given a linear transformation $g$ such that $g(\Omega)\subset \Omega$ and a…

We study the Lie algebra structure of the Onsager algebra from the ideal theoretic point of view. A structure theorem of ideals in the Onsager algebra is obtained with the connection to the finite-dimensional representations. We also…

We consider the question as to whether the exponent of a computably presentable Lebesgue space whose dimension is at least 2 must be computable. We show this very natural conjecture is true when the exponent is at least 2 or when the space…

In this paper we show that if $(X,\mathcal{A})$ is a measurable space and if $Y$ is a topological model of a Lawvere theory $\mathcal{T}$ equipped with $\mathcal{B}$ the Borel $\sigma$-algebra on $Y$, then the set of…

Consider the semialgebraic structure over the real field. More generally, let an ominimal structure be over a real closed field. We show that a definable metric space X with a definable metric d is embedded into a Euclidean space so that…

Using new techniques for controlling the categoricity spectrum of a structure, we construct a structure with degree of categoricity but infinite spectral dimension, answering a question of Bazhenov, Kalimulin and Yamaleev. Using the same…

This expository paper treats the model theory of probability spaces using the framework of continuous $[0,1]$-valued first order logic. The metric structures discussed, which we call probability algebras, are obtained from probability…

computable functions are defined by abstract finite deterministic algorithms on many-sorted algebras. We show that there exist finite universal algebraic specifications that specify uniquely (up to isomorphism) (i) all abstract computable…

We prove two results intended to streamline proofs about cellularity that pass through mutual algebraicity. First, we show that a countable structure $M$ is cellular if and only if $M$ is $\omega$-categorical and mutually algebraic. Second,…

(1) Let 1\leq k\leq \omega. Call an atom structure \alpha weakly k neat representable, the term algebra is in \RCA_n\cap \Nr_n\CA_{n+k}, but the complex algebra is not representable. Call an atom structure neat if there is an atomic algebra…