Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · math/0009062

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

Rüdiger Göbel·Saharon Shelah
View original source ↗Read source document ↗Export metadata ↓

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

math.LOmath.ACmath.RA

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

arXiv2026

Bluebirds and mockingbirds cannot produce a fixed-point combinator

Let $B$ be the bluebird combinator with reduction rule $Bxyz \to_{w} x\left(yz\right)$, let $M$ be the mockingbird combinator with reduction rule $Mx \to_{w} xx$, and let $I$ be the identity bird combinator with reduction rule $Ix \to_{w} x$. A fixed-point combinator, called a sage bird by Smullyan, is a closed term $Y$ such that, for a fresh variable $x$, $Yx$ is equivalent to $x\left(Yx\right)$ under these reduction rules. For a fixed variable $x$, we construct an invariant $\mathrm{Tr}_{x}\left(u\right)$ of a $BMI$-term $u$ with respect to $\to_{w}$. This invariant traces the occurrences of $x$ in the leftmost-innermost reduction sequence of $u$. We then prove that $\mathrm{Tr}_{x}\left(Yx\right) \neq \mathrm{Tr}_{x}\left(x^{r}\left( Yx \right)\right)$ for every $x$-free $BMI$-term $Y$ and every $r\geq 1$. Consequently, there exists no fixed-point combinator in $BMI$-combinatory logic. This provides a negative answer to the problem posed by Smullyan in 1985.

math.LO↗
arXiv2026

Pointwise provable equality and the failure of composition

Montagna (1989) and Di Paola--Montagna (1991) claim that the algebraic systems $S'$ and $S'_T$, respectively, are categories. We show that the proposed composition is not independent of the choice of representatives. For every consistent recursively enumerable extension $T$ of Peano arithmetic ($\mathrm{PA}$), we exhibit two program indices that are pointwise provably equal in $T$ but yield inequivalent composites when each is run after the same program. Montagna's $S'$ is the case $T=\mathrm{PA}$. The failure already occurs for partial maps from $ω$ to itself. Weak totality and the proposed range assignment also depend on the choice of representatives. More generally, for consistent $T\supseteq\mathrm{PA}$, pointwise provable equality is a composition congruence exactly when $T$ proves every true $Π^0_1$ sentence, in which case it is extensional equality. This completeness condition fails for every consistent recursively enumerable $T\supseteq\mathrm{PA}$ by Gödel's second incompleteness theorem. For every extension $T\supseteq\mathrm{PA}$, the least composition congruence containing pointwise provable equality is extensional equality if $T$ is $Σ^0_1$-sound and the universal relation otherwise.

math.LO↗
arXiv2026

Compactness via Consistency Properties

We will use consistency properties to characterize strongly compact cardinals, first showing an adequate Model Existence Theorem for larger fragments.

math.LO↗