SearcharxivSearch

arXiv · 2412.19380

Vop\v{e}nka's Principle, Maximum Deconstructibility, and singly-generated torsion classes

Abstract

Deconstructibility is an often-used sufficient condition on a class $\mathcal{C}$ of modules that allows one to carry out homological algebra \emph{relative to $\mathcal{C}$}. The principle \textbf{Maximum Deconstructibility (MD)} asserts that a certain necessary condition for a class to be deconstructible is also sufficient. MD implies, for example, that the classes of Gorenstein Projective modules, Ding Projective modules, their relativized variants, and all torsion classes are deconstructible over any ring. MD was known to follow from Vop\v{e}nka's Principle and imply the existence of an $\omega_1$-strongly compact cardinal. We prove that MD is equivalent to Vop\v{e}nka's Principle, and to the assertion that each torsion class of abelian groups is generated by a single group within the class (yielding the converse of a theorem of G\"obel and Shelah).

Explore related subjects

Keep this discovery

BibTeXRIS

Sean Cox. 2024-12-26. Vop\v{e}nka's Principle, Maximum Deconstructibility, and singly-generated torsion classes. https://arxiv.org/abs/2412.19380

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