Searcharxiv⌕ Search

arXiv · 0710.0157

PCF and Abelian Groups

Abstract

We deal with some pcf investigations mostly motivated by abelian group theory problems and deal their applications to test problems (we expect reasonably wide applications). We prove almost always the existence of aleph_omega-free abelian groups with trivial dual, i.e. no non-trivial homomorphisms to the integers. This relies on investigation of pcf; more specifically, for this we prove that "almost always" there are F subseteq lambda^kappa which are quite free and has black boxes. The "almost always" means that there are strong restrictions on cardinal arithmetic if the universe fails this, the restrictions are "everywhere". Also we replace Abelian groups by R-modules, so in some sense our advantage over earlier results becomes clearer.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Saharon Shelah. 2017-08-07. PCF and Abelian Groups. https://arxiv.org/abs/0710.0157

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Model completeness for the differential field of transseries with exponentiation

We show that the expansion of the valued differential field of logarithmic-exponential transseries by its natural exponential function is model complete. We give an axiomatization of the theory of this expansion that is effective relative to the theory of the real exponential field, and show that any maximal Hardy field satisfies the same axioms. We use this to prove a transfer theorem between Hardy fields and transseries.

math.LO↗

Extended Frege proofs, circuits and rewriting

Inspired by a statement about Extended Frege proof systems by Jain and Jin (FOCS 2022) we prove that: - there is a p-time binary relation $\approx$ between circuits that implies their logical equivalence, - if the equivalence $C \equiv D$ has an Extended Frege or a Circuit Frege proof with $k$ steps then there is a chain of circuits $E_i$ $$ C = E_0 \approx \dots \approx E_t = D $$ with $t \le O(k \log k)$, and the total size of the chain is bounded above by $(k+|C|+|D|)^{O(1)}$.

math.LO↗

A Zero--One Law for Subrings of the Reals Closed under Binary Interleaving

Erdős Problem 1154 asks whether every number in $[0,1]$ occurs as the Hausdorff dimension of a subring or subfield of $\mathbb{R}$. We prove that a subring of $\mathbb{R}$ closed under binary interleaving has Hausdorff dimension either zero or one. Consequently, every Turing ideal and its associated subfield satisfy the same dichotomy.

math.LO↗