English
Related papers

Related papers: Covering the recursive sets

200 papers

We investigate issues surrounding an old question of Yates' as to the existence of a minimal Turing degree with no strong minimal cover, specifically with respect to the hyperimmune-free degrees.

Logic · Mathematics 2007-11-05 Andrew E. M. Lewis

"How much c.e. sets could cover a given set?" in this paper we are going to answer this question. Also, in this approach some old concepts come into a new arrangement. The major goal of this article is to introduce an appropriate definition…

Formal Languages and Automata Theory · Computer Science 2012-03-06 Farzad Didehvar , Mohsen Mansouri , Zahra Taheri

We show that every countable ideal of degrees that are low for isomorphism is contained in a principal ideal of degrees that are low for isomorphism by adapting an exact pair construction. We further show that within the hyperimmune-free…

Logic · Mathematics 2019-09-16 Johanna N. Y. Franklin , Reed Solomon

For which sets A does there exist a mapping, computed by a total or partial recursive function, such that the mapping, when its domain is restricted to A, is a 1-to-1, onto mapping to $\Sigma^*$? And for which sets A does there exist such a…

Logic in Computer Science · Computer Science 2017-12-05 Lane A. Hemaspaandra , Daniel Rubery

This work is motivated by the problem of finding the limit of the applicability of the first incompleteness theorem ($\sf G1$). A natural question is: can we find a minimal theory for which $\sf G1$ holds? We examine the Turing degree…

Logic · Mathematics 2025-10-07 Yong Cheng

The separation between two theorems in reverse mathematics is usually done by constructing a Turing ideal satisfying a theorem P and avoiding the solutions to a fixed instance of a theorem Q. Lerman, Solomon and Towsner introduced a forcing…

Logic · Mathematics 2015-03-13 Ludovic Patey

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…

Logic · Mathematics 2020-06-23 Sam Sanders

Richter, Stephan, and Zhang asked whether every nonrecursive many-one degree contains a least finite-one degree. We solve this question in the negative, already within the class of computably enumerable many-one degrees. Positive answers…

Logic · Mathematics 2026-04-14 Patrizio Cintioli

For four wide classes of topological rings $\mathfrak R$, we show that all flat left $\mathfrak R$-contramodules have projective covers if and only if all flat left $\mathfrak R$-contramodules are projective if and only if all left…

Category Theory · Mathematics 2022-01-12 Leonid Positselski

A non-empty subset of a topological space is irreducible if whenever it is covered by the union of two closed sets, then already it is covered by one of them. Irreducible sets occur in proliferation: (1) every singleton set is irreducible,…

Logic in Computer Science · Computer Science 2016-10-04 Hadrian Andradi , Weng Kin Ho

A Ramsey-like theorem is a statement of the form ``For every 2-coloring of $[\mathbb{N}]^2$, there exists an infinite set~$H \subseteq \mathbb{N}$ such that $[H]^2$ avoids some pattern''. We prove that none of these statements are…

Logic · Mathematics 2026-05-12 Ahmed Mimouni , Ludovic Patey

We conjecture that for a strongly minimal theory T in a finite signature satisfying the Zilber Trichotomy, there are only three possibilities for the recursive spectrum of T: all countable models of T are recursively presentable; none of…

Logic · Mathematics 2012-06-19 Uri Andrews , Alice Medvedev

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

Discrete Mathematics · Computer Science 2017-08-08 Emmanuel Jeandel

Do complexity classes have many-one complete sets if and only if they have Turing-complete sets? We prove that there is a relativized world in which a relatively natural complexity class-namely a downward closure of NP, \rsnnp - has…

Computational Complexity · Computer Science 2007-05-23 Edith Hemaspaandra , Lane A. Hemaspaandra , Harald Hempel

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…

Logic · Mathematics 2017-09-06 Eric P. Astor

In this paper we establish connections between covers of $\mathbb Z$ by residue classes and subset sums in a field. Suppose that $A_0=\{a_s(n_s)\}_{s=0}^k$ covers each integer at least $p$ times with the residue class…

Number Theory · Mathematics 2020-08-11 Zhi-Wei Sun

Xiang Li (1983) introduced what are now called constructively immune sets as an effective version of immunity. Such have been studied in relation to randomness and minimal indices, and we add another application area: numberings of the…

Logic · Mathematics 2021-04-28 Samuel D. Birns , Bjørn Kjos-Hanssen

In this paper we consider the class $\mathcal{P}_1(R)$ of modules of projective dimension at most one over a commutative ring $R$ and we investigate when $\mathcal{P}_1(R)$ is a covering class. More precisely, we investigate Enochs'…

Commutative Algebra · Mathematics 2020-01-30 Silvana Bazzoni , Giovanna Le Gros

Dag Normann and the author have recently initiated the study of the logical and computational properties of the uncountability of $\mathbb{R}$ formalised as the statement $\textsf{NIN}$ (resp. $\textsf{NBI}$ that there is no injection…

Logic · Mathematics 2020-11-06 Sam Sanders

Let A={a_s(mod n_s)}_{s=1}^k and B={b_t(mod m_t)}_{t=1}^l be two systems of residue classes. If |{1\le s\le k: x=a_s (mod n_s)}| and |{1\le t\le l: x=b_t (mod m_t)}| are equal for all integers x, then A and B are said to be covering…

Number Theory · Mathematics 2007-10-22 Hao Pan , Zhi-Wei Sun
‹ Prev 1 2 3 10 Next ›