Related papers: Listing the hyperarithmetical functions

Let $ M (X)$ be the ring of all real measurable functions on a measurable space $(X, \mathscr{A})$. In this article, we show that every ideal of $M(X)$ is a $Z^{\circ}$-ideal. Also, we give several characterizations of maximal ideals of…

This paper introduces the expanded real numbers as an ordered subring of the hyperreal number field that does not contain any infinitesimals, and defines the set of all integrable functions from the real numbers to the expanded real…

A type-2 computable real function is necessarily continuous; and this remains true for relative, i.e. oracle-based computations. Conversely, by the Weierstrass Approximation Theorem, every continuous f:[0,1]->R is computable relative to…

Let T be a complete, first-order theory in a finite or countable language having infinite models. Let I(T,kappa) be the number of isomorphism types of models of T of cardinality \kappa. We denote by \mu (respectively \hat\mu) the number of…

A real X is defined to be relatively c.e. if there is a real Y such that X is c.e.(Y) and Y does not compute X. A real X is relatively simple and above if there is a real Y <_T X such that X is c.e.(Y) and there is no infinite subset Z of…

The function $\epsilon(x)=\mbox{li}(x)-\pi(x)$ is known to be positive up to the (very large) Skewes' number. Besides, according to Robin's work, the functions $\epsilon_{\theta}(x)=\mbox{li}[\theta(x)]-\pi(x)$ and…

For a nonempty topological space X, the ring of all real-valued functions on $X$ with pointwise addition and multiplication is denoted by $F(X)$ and continuous members of $F(X)$ is denoted by $C(X)$. Let $A(X)$ be a subring of $F(X)$ and…

We show that every strongly jump-traceable set obeys every benign cost function. Moreover, we show that every strongly jump-traceable set is computable from a computably enumerable strongly jump-traceable set. This allows us to generalise…

Hilbert's Tenth Problem over the field $\mathbb Q$ of rational numbers is one of the biggest open problems in the area of undecidability in number theory. In this paper we construct new, computably presentable subrings $R$ of $\mathbb Q$…

We prove that many seemingly simple theories have Borel complete reducts. Specifically, if a countable theory has uncountably many complete 1-types, then it has a Borel complete reduct. Similarly, if $Th(M)$ is not small, then $M^{eq}$ has…

We examine the computable part of the differentiability hierarchy defined by Kechris and Woodin. In that hierarchy, the rank of a differentiable function is an ordinal less than omega_1 which measures how complex it is to verify…

One point compactification is studied in the light of ideal of subsets of $\mathbb{N}$. $\mathcal{I}$-proper map is introduced and showed that a continuous map can be extended continuously to the one point $\mathcal{I}$-compactification if…

As a generalization of nil clean ideal, we define weak nil clean ideal of a ring. An ideal $I$ of a ring $R$ is weak nil clean ideal if for any $x\in I$, either $x=e+n$ or $x=-e+n$, where $n$ is a nilpotent element and $e$ is an idempotent…

One of the most fundamental mathematical contributions of Garrett Birkhoff is the HSP theorem, which implies that a finite algebra B satisfies all equations that hold in a finite algebra A of the same signature if and only if B is a…

We conclude from Goedel's Theorem VII of his seminal 1931 paper that every recursive function f(x_{1}, x_{2}) is representable in the first-order Peano Arithmetic PA by a formula [F(x_{1}, x_{2}, x_{3})] which is algorithmically verifiable,…

We study countable structures from the viewpoint of enumeration reducibility. Since enumeration reducibility is based on only positive information, in this setting it is natural to consider structures given by their positive atomic diagram…

For $r \in [0,1]$ we say that a set $A \subseteq \omega$ is \emph{coarsely computable at density} $r$ if there is a computable set $C$ such that $\{n : C(n) = A(n)\}$ has lower density at least $r$. Let $\gamma(A) = \sup \{r : A \hbox{ is…

A natural integer is called $y$-ultrafriable if none of the prime powers occurring in its canonical decomposition exceed $y$. We investigate the distribution of $y$-ultrafriable integers not exceeding $x$ among arithmetic progressions to…

We prove lifting theorems for completely positive maps going out of exact $C^\ast$-algebras, where we remain in control of which ideals are mapped into which. A consequence is, that if $\mathsf X$ is a second countable topological space,…

A subset $A$ of a topological space $X$ is called relatively functionally countable (RFC) in $X$, if for each continuous function $f : X \to \mathbb{R}$ the set $f[A]$ is countable. We prove that all RFC subsets of a product…