SearcharxivSearch

arXiv · 1903.00414

On universal modules with pure embeddings

Abstract

We show that certain classes of modules have universal models with respect to pure embeddings. $Theorem.$ Let $R$ be a ring, $T$ a first-order theory with an infinite model extending the theory of $R$-modules and $K^T=(Mod(T), \leq_{pp})$ (where $\leq_{pp}$ stands for pure submodule). Assume $K^T$ has joint embedding and amalgamation. If $\lambda^{|T|}=\lambda$ or $\forall \mu < \lambda( \mu^{|T|} < \lambda)$, then $K^T$ has a universal model of cardinality $\lambda$. As a special case we get a recent result of Shelah [Sh17, 1.2] concerning the existence of universal reduced torsion-free abelian groups with respect to pure embeddings. We begin the study of limit models for classes of $R$-modules with joint embedding and amalgamation. We show that limit models with chains of long cofinality are pure-injective and we characterize limit models with chains of countable cofinality. This can be used to answer Question 4.25 of [Maz]. As this paper is aimed at model theorists and algebraists an effort was made to provide the background for both.

Explore related subjects

Keep this discovery

BibTeXRIS

Thomas G. Kucera, Marcos Mazari-Armida. 2019-03-01. On universal modules with pure embeddings. https://arxiv.org/abs/1903.00414

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO