相关论文: Listing the hyperarithmetical functions

Given an ideal $a \subseteq R$ in a (log) $Q$-Gorenstein $F$-finite ring of characteristic $p > 0$, we study and provide a new perspective on the test ideal $\tau(R, a^t)$ for a real number $t > 0$. Generalizing a number of known results…

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…

In a previous paper, the author introduced the idea of intrinsic density --- a restriction of asymptotic density to sets whose density is invariant under computable permutation. We prove that sets with well-defined intrinsic density (and…

In this paper, we investigate the problem of synthesizing computable functions of infinite words over an infinite alphabet (data omega-words). The notion of computability is defined through Turing machines with infinite inputs which can…

The symbolic powers $I^{(n)}$ of a radical ideal $I$ in a polynomial ring consist of the functions that vanish up to order $n$ in the variety defined by $I$. These do not necessarily coincide with the ordinary algebraic powers $I^n$, but it…

Let $L$ be a solvable Lie algebra of dimension less than or equal to 4 over finite fields. We compute and record, in explicit symbolic form, the zeta functions enumerating subalgebras or ideals of $L$, and study their properties. We also…

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…

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

In the set of continuous functions C(X,Y) where Y has a topology close to being discrete, there is an equivalence relation on X which characterizes the quasi-components of X. If Y satisfies weak algebraic conditions with a single binary…

Infinite time Turing machine models with tape length $\alpha$, denoted $T_\alpha$, strengthen the machines of Hamkins and Kidder [HL00] with tape length $\omega$. A new phenomenon is that for some countable ordinals $\alpha$, some cells…

We study $\mathcal I$-maximal eventually different families of functions from the set of natural numbers into itself where $\mathcal I$ is an arbitrary ideal on the set of natural numbers that includes the ideal of all finite sets…

If X and Y are orthogonal hyperdefinable sets such that X is simple, then any group G interpretable in (X,Y) has a normal hyperdefinable X-internal subgroup N such that G/N is Y-internal; N is unique up to commensurability. In order to make…

Let $R^h$ denote the polynomial ring in variables $x_1,\,\ldots,\, x_h$ over a specified field $K$. We consider all of these rings simultaneously, and in each use lexicographic (lex) monomial order with $x_1 > \cdots > x_h$. Given a fixed…

Literature considers under the name \emph{unimaginable numbers} any positive integer going beyond any physical application, with this being more of a vague description of what we are talking about rather than an actual mathematical…

We study $\mathbb{R}_{\textrm{an},\exp}$-definable functions $f:\mathbb{R}\to \mathbb{R}$ that take integer values at all sufficiently large positive integers. If $|f(x)|= O\big(2^{(1+10^{-5})x}\big)$, then we find polynomials $P_1, P_2$…

In this paper, we introduce a new generalization of weakly prime ideals called $I$-prime. Suppose $R$ is a commutative ring with identity and $I$ a fixed ideal of $R$. A proper ideal $P$ of $R$ is $I$-prime if for $a, b \in R$ with $ab \in…

Let $n$ and $k$ be positive integers, and $f_n(k)$ (resp. $g_n(k)$) be the number of unital subrings (resp. unital irreducible subrings) of $\mathbb{Z}^n$ of index $k$. The numbers $f_n(k)$ are coefficients of certain zeta functions of…

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…

The aim of this paper is to give natural examples of $\mathbf{\Sigma}_1^1$-complete and $\mathbf{\Pi}_1^1$-complete sets. In the first part, we consider ideals on $\omega$. In particular, we show that the Hindman ideal $\mathcal{H}$ is…

Given an ideal $\mathcal{I}$ on $\omega$ and a bounded real sequence $\textbf{x}$, we denote by $\text{core}_{\textbf{x}}(\mathcal{I})$ the smallest interval $[a,b]$ such that $\{n \in \omega: x_n \notin [a-\varepsilon,b+\varepsilon]\} \in…