English
Related papers

Related papers: Covering the recursive sets

200 papers

We prove that it is consistent that the covering of the ideal of measure zero sets has countable cofinality.

Logic · Mathematics 2016-09-07 Saharon Shelah

We study some closely interrelated notions of Homological Algebra: (1) We define a topology on modules over a not-necessarily commutative ring $R$ that coincides with the $R$-topology defined by Matlis when $R$ is commutative. (2) We…

Rings and Algebras · Mathematics 2018-08-08 Alberto Facchini , Zahra Nazemian

In the early two-thousands, Recursive Petri nets have been introduced in order to model distributed planning of multi-agent systems for which counters and recursivity were necessary. Although Recursive Petri nets strictly extend Petri nets…

Logic in Computer Science · Computer Science 2023-06-22 Alain Finkel , Serge Haddad , Igor Khmelnitsky

The Heine-Borel theorem for uncountable coverings has recently emerged as an interesting and central principle in higher-order Reverse Mathematics and computability theory, formulated as follows: HBU is the Heine-Borel theorem for…

Logic · Mathematics 2021-06-11 Sam Sanders

In a previous paper the authors developed a H^1-BMO theory for unbounded metric measure spaces $(M,\rho,m)$ of infinite measure that are locally doubling and satisfy two geometric properties, called "approximate midpoint" property and…

Functional Analysis · Mathematics 2008-11-04 A. Carbonaro , G. Mauceri , S. Meda

$(1)$ Let $M\subset N$ be a commutative cancellative torsion-free and subintegral extension of monoids. Then we prove that in the case of ring extension $A[M]\subset A[N]$, the two notions, subintegral and weakly subintegral coincide…

Commutative Algebra · Mathematics 2025-07-21 Md Abu Raihan , Leslie G. Roberts , Husney Parvez Sarwar

We give a reframing of Godel's first and second incompleteness theorems that applies even to some undefinable theories of arithmetic. The usual Hilbert-Bernays provability conditions and the diagonal lemma are replaced by a more direct…

Logic · Mathematics 2024-12-19 Yasha Savelyev

Using the idea of strong uniform convergence on bornology, Caserta, Di Maio and Ko\v{c}inac studied open covers and selection principles in the realm of metric spaces (associated with a bornology) and function spaces (w.r.t. the topology of…

General Topology · Mathematics 2020-06-02 Debraj Chandra , Pratulananda Das , Shunhankar Das

We answer two questions of Kra, Moreira, Richter and Robertson regarding the existence of infinite sumsets of the form $B + C$ in dense and sparse sets of integers and the relation of sumsets to sets of recurrence. We then further…

Dynamical Systems · Mathematics 2025-10-16 Luke Hetzel

We show that the metric universal cover of a plane with a puncture yields an example of a nonstandard hull properly containing the metric completion of a metric space. As mentioned by do Carmo, a nonextendible Riemannian manifold can be…

Differential Geometry · Mathematics 2020-03-05 Vladimir Kanovei , Mikhail G. Katz , Tahl Nowik

The signature of closed oriented manifolds is well-known to be multiplicative under finite covers. This fails for Poincar\'e complexes as examples of C. T. C. Wall show. We establish the multiplicativity of the signature, and more…

Algebraic Topology · Mathematics 2017-06-13 Markus Banagl

We give a survey on the theory of representation-finite and certain minimal representation-infinite algebras.The main goals are the existence of multiplicative bases and of coverings with good properties. Both are attained via…

Representation Theory · Mathematics 2013-02-06 Klaus Bongartz

We consider formal verification of recursive programs with resource consumption. We introduce prefix replacement systems with non-negative integer counters which can be incremented and reset to zero as a formal model for such programs. In…

Logic in Computer Science · Computer Science 2015-07-01 Martin Lang , Christof Löding

Pattern avoidance classes of permutations that cannot be expressed as unions of proper subclasses can be described as the set of subpermutations of a single bijection. In the case that this bijection is a permutation of the natural numbers…

Combinatorics · Mathematics 2007-05-23 M. D. Atkinson , M. M. Murphy , N. Ruskuc

To enable the study of open sets in computational approaches to mathematics, lots of extra data and structure on these sets is assumed. For both foundational and mathematical reasons, it is then a natural question, and the subject of this…

Logic · Mathematics 2020-10-02 Dag Normann , Sam Sanders

Since their introduction by Erd\H{o}s in 1950, covering systems (that is, finite collections of arithmetic progressions that cover the integers) have been extensively studied, and numerous questions and conjectures have been posed regarding…

Number Theory · Mathematics 2018-11-09 Paul Balister , Béla Bollobás , Robert Morris , Julian Sahasrabudhe , Marius Tiba

Nonuniformity is a central concept in computational complexity with powerful connections to circuit complexity and randomness. Nonuniform reductions have been used to study the isomorphism conjecture for NP and completeness for larger…

Computational Complexity · Computer Science 2018-01-19 John M. Hitchcock , Hadi Shafei

We define $\Psi$-autoreducible sets given an autoreduction procedure $\Psi$. Then, we show that for any $\Psi$, a measurable class of $\Psi$-autoreducible sets has measure zero. Using this, we show that classes of cototal, uniformly…

Logic · Mathematics 2024-02-14 Ang Li

We introduce an algorithm that conjectures the structure of a permutation class in the form of a disjoint cover of "rules"; similar to generalized grid classes. The cover is usually easily verified by a human and translated into an…

Combinatorics · Mathematics 2017-05-12 Christian Bean , Bjarki Gudmundsson , Henning Ulfarsson

We study the logical content of several maximality principles related to the finite intersection principle ($F\IP$) in set theory. Classically, these are all equivalent to the axiom of choice, but in the context of reverse mathematics their…

Logic · Mathematics 2014-12-15 Damir D. Dzhafarov , Carl Mummert