English
Related papers

Related papers: Lowness for isomorphism, countable ideals, and com…

200 papers

The interrelations between various classes of convergence spaces defined by countability conditions are studied. Remarkably, they all find characterizations in the usual space of ultrafilters in terms of classical topological properties.…

General Topology · Mathematics 2021-01-13 Frédéric Mynard

In this article, we investigate the avoidance property of ideals and rings. Among the main results, a general version of the avoidance lemma is formulated. It is shown that every idempotent ideal (and hence every pure ideal) has avoidance.…

Commutative Algebra · Mathematics 2023-09-07 Justin Chen , Abolfazl Tarizadeh

We present a method for constructing countable models of small theories and apply it to prove theorems on the maximal number of countable non-isomorphic models of linearly ordered theories.

Logic · Mathematics 2021-10-01 Bektur Baizhanov , Tatyana Zambarnaya

In this paper, we provide a complete description of the minimal primes of ideals generated by adjacent $2$-minors, in terms of the so-called admissible sets and associated lattice ideals. We prove that for these ideals, the properties of…

Commutative Algebra · Mathematics 2025-12-29 Takayuki Hibi , Francesco Navarra , Ayesha Asloob Qureshi , Sara Saeedi Madani

We give solutions to two of the questions in a paper by Brendle, Brooke-Taylor, Ng and Nies. Our examples derive from a 2014 construction by Khan and Miller as well as new direct constructions using martingales. At the same time, we…

Logic · Mathematics 2017-12-19 Bjørn Kjos-Hanssen , Frank Stephan , Sebastiaan A. Terwijn

We show that the embeddability relations for countable quandles and for countable fields of any given characteristic other than 2 are maximally complex in a strong sense: they are invariantly universal. This notion from the theory of Borel…

Logic · Mathematics 2020-07-21 Andrew D. Brooke-Taylor , Filippo Calderoni , Sheila K. Miller

Let $\mathcal A$ be a simple, $\sigma$-unital, non-unital, non-elementary C*-algebra and let $I_{min}$ be the intersection of all the ideals of $\mathcal M(\mathcal A)$ that properly contain $\mathcal A$. $I_{min}$ coincides with the ideal…

Operator Algebras · Mathematics 2017-05-15 Victor Kaftal , P. W. Ng , Shuang Zhang

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 solve the covering problem for Demuth randomness, showing that a computably enumerable set is computable from a Demuth random set if and only if it is strongly jump-traceable. We show that on the other hand, the class of sets which form…

Logic · Mathematics 2011-09-29 Noam Greenberg , Daniel Turetsky

For a finitely generated module $M$, over a commutative Noetherian local ring $(R, \mathfrak{m})$, it is shown that there exist only a finite number of non--isomorphic top local cohomology modules $\mathrm{H}_{\mathfrak{a}}^{\mathrm{dim}…

Commutative Algebra · Mathematics 2007-05-23 Mohammad T. Dibaei , Siamak Yassemi

We show that there is a minimal pair in the nonuniform generic degrees, and hence also in the uniform generic degrees. This fact contrasts with Igusa's result that there are no minimal pairs for relative generic computability, and answers a…

Logic · Mathematics 2020-04-22 Denis R. Hirschfeldt

We show that for both the unary relation of transcendence and the finitary relation of algebraic independence on a field, the degree spectra of these relations may consist of any single computably enumerable Turing degree, or of those c.e.…

Logic · Mathematics 2019-08-20 Iskander Kalimullin , Russell Miller , Hans Schoutens

Working in the framework of Borel reducibility, we study various notions of embeddability between groups. We prove that the embeddability between countable groups, the topological embeddability between (discrete) Polish groups, and the…

Logic · Mathematics 2018-02-08 Filippo Calderoni , Luca Motto Ros

We are studying the degrees in which a computable structure is relatively computably categoricity, i.e., computably categorcial among all non-computable copies of the structure. Unlike the degrees of computable categoricity we can bound the…

Logic · Mathematics 2023-04-07 I. Sh. Kalimullin

A set is introreducible if it can be computed by every infinite subset of itself. Such a set can be thought of as coding information very robustly. We investigate introreducible sets and related notions. Our two main results are that the…

Logic · Mathematics 2020-11-09 Noam Greenberg , Matthew Harrison-Trainor , Ludovic Patey , Dan Turetsky

Let R be a local ring and A a connected differential graded algebra over R which is free as a graded R-module. Using homological perturbation theory techniques, we construct a minimal free multi model for A having properties similar to that…

Algebraic Topology · Mathematics 2007-05-23 Johannes Huebschmann

In this paper we examine the commutativity of ideal extensions. We introduce methods of constructing such extensions, in particular we construct a noncommutative ring T which contains a central and idempotent ideal I such that T/I is a…

Rings and Algebras · Mathematics 2013-05-15 Joachim Jelisiejew

If $S$ is a discrete semigroup, then $\beta S$ has a natural, left-topological semigroup structure extending $S$. Under some very mild conditions, $U(S)$, the set of uniform ultrafilters on $S$, is a two-sided ideal of $\beta S$, and…

Rings and Algebras · Mathematics 2015-05-11 Will Brian

We show that there are Turing complete computably enumerable sets of arbitrarily low non-trivial initial segment prefix-free complexity. In particular, given any computably enumerable set $A$ with non-trivial prefix-free initial segment…

Logic · Mathematics 2013-11-28 George Barmpalias

We conduct a computability-theoretic study of Ramsey-like theorems of the form "Every coloring of the edges of an infinite clique admits an infinite sub-clique avoiding some pattern", with a particular focus on transitive patterns. As it…

Logic · Mathematics 2025-07-11 Quentin Le Houérou , Ludovic Patey