SearcharxivSearch

arXiv · math/0009062

Reflexive subgroups of the Baer-Specker group and Martin's axiom

Abstract

In two recent papers (math.LO/0003164 and math.LO/0003165) we answered a question raised in the book by Eklof and Mekler (p. 455, Problem 12) under the set theoretical hypothesis of diamondsuit_{aleph_1} which holds in many models of set theory, respectively of the special continuum hypothesis (CH). The objects are reflexive modules over countable principal ideal domains R, which are not fields. Following H.Bass, an R-module G is reflexive if the evaluation map s:G ---> G^{**} is an isomorphism. Here G^*=Hom(G,R) denotes the dual module of G. We proved the existence of reflexive R-modules G of infinite rank with G not cong G+R, which provide (even essentially indecomposable) counter examples to the question mentioned above. Is CH a necessary condition to find `nasty' reflexive modules? In the last part of this paper we will show (assuming the existence of supercompact cardinals) that large reflexive modules always have large summands. So at least being essentially indecomposable needs an additional set theoretic assumption. However the assumption need not be CH as shown in the first part of this paper. We will use Martin's axiom to find reflexive modules with the above decomposition which are submodules of the Baer-Specker module R^omega.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rüdiger Göbel, Saharon Shelah. 2000-09-06. Reflexive subgroups of the Baer-Specker group and Martin's axiom. https://arxiv.org/abs/math/0009062

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