相关论文: Listing the hyperarithmetical functions

Let $X$ be an uncountable Polish space and let $\mathcal{H}$ be the Hindman ideal, that is, the family of all $S\subseteq \omega$ which are not $IP$-sets. For each sequence $x=(x_n)_{n \in \omega}$ taking values in $X$, let…

Let X be an algebraic toric set in a projective space over a finite field. We study the vanishing ideal, I(X), of X and show some useful degree bounds for a minimal set of generators of I(X). We give an explicit description of a set of…

We construct a topos in which the Dedekind reals are countable. The topos arises from a new kind of realizability, which we call parameterized realizability, based on partial combinatory algebras whose application depends on a parameter.…

Given a list of complex numbers \sigma:=(\lambda_1,\lambda_2,...,\lambda_m), we say that {\sigma} is realisable if {\sigma} is the spectrum of some (entrywise) nonnegative matrix. The Nonnegative Inverse Eigenvalue Problem (or NIEP) is the…

We introduce a very natural topology on the set of total orderings of monomials of any algebra having a countable basis over a field. This topological space and some notable subspaces are compact. This topological framework allows us to…

An ideal is a nonempty collection of subsets closed under heredity and finite additivity. The aim of this paper is to unify some weak separation properties via topological ideals. We concentrate our attention on the separation axioms…

Let $R$ be a reduced affine $\mathbb C$-algebra, with corresponding affine algebraic set $X$. Let $\mathcal C(X)$ be the ring of continuous (Euclidean topology) $\mathbb C$-valued functions on $X$. Brenner defined the \emph{continuous…

We define a class of functions termed "Computable in the Limit", based on the Machine Learning paradigm of "Identification in the Limit". A function is Computable in the Limit if it defines a property P_p of a recursively enumerable class A…

A fundamental question is whether Turing machines can model all reasoning processes. We introduce an existence principle stating that the perception of the physical existence of any Turing program can serve as a physical causation for the…

We fix a gap in our proof of an upper bound for the number of positive integers $n\le x$ for which the Euler function $\varphi(n)$ has all prime factors at most $y$. While doing this we obtain a stronger, likely best-possible result.

We give an effective procedure that produces a natural number in its output from any natural number in its input, that is, it computes a total function. The elementary operations of the procedure are Turing-computable. The procedure has a…

Let G be a finite group, (g_{1},...,g_{r}) an (unordered) r-tuple of G^{(r)} and x_{i,g_i}'s variables that correspond to the g_i's, i=1,...,r. Let F<x_{1,g_1},...,x_{r,g_r}> be the corresponding free G-graded algebra where F is a field of…

A cohesive power of a computable structure is an effective ultrapower where a cohesive set acts as an ultrafilter. Let $\omega$, $\zeta$, and $\eta$ denote the respective order-types of the natural numbers, the integers, and the rationals.…

This is the first of two papers devoted to connections between asymptotic functions of groups and computational complexity. One of the main results of this paper states that if for every $m$ the first $m$ digits of a real number $\alpha\ge…

This is a continuation of the paper [J. Symb. Log. 87 (2022), 1065--1092]. For an ideal $\mathcal{I}$ on $\omega$ we denote $\mathcal{D}_{\mathcal{I}}=\{f\in\omega^\omega: f^{-1}[\{n\}]\in\mathcal{I} \text{ for every $n\in \omega$}\}$ and…

Let $X$ be an uncountable Polish space and let $\mathcal{I}$ be an ideal on $\omega$. A point $\eta \in X$ is an $\mathcal{I}$-limit point of a sequence $(x_n)$ taking values in $X$ if there exists a subsequence $(x_{k_n})$ convergent to…

Cohesive powers of computable structures are effective analogs of ultrapowers, where cohesive sets play the role of ultrafilters. Let $\omega$, $\zeta$, and $\eta$ denote the respective order-types of the natural numbers, the integers, and…

A function f is continuous iff the PRE-image f^{-1}[V] of any open set V is open again. Dual to this topological property, f is called OPEN iff the IMAGE f[U] of any open set U is open again. Several classical Open Mapping Theorems in…

For a Hausdorff zero-dimensional topological space $X$ and a totally ordered field $F$ with interval topology, let $C_c(X,F)$ be the ring of all $F-$valued continuous functions on $X$ with countable range. It is proved that if $F$ is either…

We study the computability-theoretic complexity and proof-theoretic strength of the following statements: (1) "If X is a well-ordering, then so is epsilon_X", and (2) "If X is a well-ordering, then so is phi(alpha,X)", where alpha is a…