SearcharxivSearch

arXiv · 2010.02918

Some stable non-elementary classes of modules

Abstract

Fisher [Fis75] and Baur [Bau75] showed independently in the seventies that if $T$ is a complete first-order theory extending the theory of modules, then the class of models of $T$ with pure embeddings is stable. In [Maz4, 2.12], it is asked if the same is true for any abstract elementary class $(K, \leq_p)$ such that $K$ is a class of modules and $\leq_p$ is the pure submodule relation. In this paper we give some instances where this is true: $\textbf{Theorem.}$ Assume $R$ is an associative ring with unity. Let $(K, \leq_p)$ be an AEC such that $K \subseteq R\text{-Mod}$ and $K$ is closed under finite direct sums, then: - If $K$ is closed under pure-injective envelopes, then $(K, \leq_p)$ is $\lambda$-stable for every $\lambda \geq LS(K)$ such that $\lambda^{|R| + \aleph_0}= \lambda$. - If $K$ is closed under pure submodules and pure epimorphic images, then $(K, \leq_p)$ is $\lambda$-stable for every $\lambda$ such that $\lambda^{|R| + \aleph_0}= \lambda$. - Assume $R$ is Von Neumann regular. If $K$ is closed under submodules and has arbitrarily large models, then $(K, \leq_p)$ is $\lambda$-stable for every $\lambda$ such that $\lambda^{|R| + \aleph_0}= \lambda$. As an application of these results we give new characterizations of noetherian rings, pure-semisimple rings, dedekind domains, and fields via superstability. Moreover, we show how these results can be used to show a link between being good in the stability hierarchy and being good in the axiomatizability hierarchy. Another application is the existence of universal models with respect to pure embeddings in several classes of modules. Among them, the class of flat modules and the class of injective torsion modules.

Explore related subjects

Keep this discovery

BibTeXRIS

Marcos Mazari-Armida. 2020-10-06. Some stable non-elementary classes of modules. https://arxiv.org/abs/2010.02918

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