SearcharxivSearch

arXiv · 2010.00184

Filtration Games and Potentially Projective Modules

Abstract

The notion of a \textbf{$\boldsymbol{\mathcal{C}}$-filtered} object, where $\mathcal{C}$ is some (typically small) collection of objects in a Grothendieck category, has become ubiquitous since the solution of the Flat Cover Conjecture around the year 2000. We introduce the \textbf{$\boldsymbol{\mathcal{C}}$-Filtration Game of length $\boldsymbol{\omega_1}$} on a module, paying particular attention to the case where $\mathcal{C}$ is the collection of all countably presented, projective modules. We prove that Martin's Maximum implies the determinacy of many $\mathcal{C}$-Filtration Games of length $\omega_1$, which in turn imply the determinacy of certain Ehrenfeucht-Fra\"iss\'{e} games of length $\omega_1$; this allows a significant strengthening of a theorem of Mekler-Shelah-Vaananen \cite{MR1191613}. Also, Martin's Maximum implies that if $R$ is a countable hereditary ring, the class of \textbf{$\boldsymbol{\sigma}$-closed potentially projective modules} -- i.e., those modules that are projective in some $\sigma$-closed forcing extension of the universe -- is closed under $<\aleph_2$-directed limits. We also give an example of a (ZFC-definable) class of abelian groups that, under the ordinary subgroup relation, constitutes an Abstract Elementary Class (AEC) with L\"owenheim-Skolem number $\aleph_1$ in some models in set theory, but fails to be an AEC in other models of set theory.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sean D. Cox. 2020-10-01. Filtration Games and Potentially Projective Modules. https://arxiv.org/abs/2010.00184

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