Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · math/9309204

Evasion and prediction --- the Specker phenomenon and Gross spaces

Jörg Brendle
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study the set--theoretic combinatorics underlying the following two algebraic phenomena. (1) A subgroup G leq Z^omega exhibits the Specker phenomenon iff every homomorphism G to Z maps almost all unit vectors to 0. Let se be the size of the smallest G leq Z^omega exhibiting the Specker phenomenon. (2) Given an uncountably dimensional vector space E equipped with a symmetric bilinear form Phi over an at most countable field KK, (E,Phi) is strongly Gross iff for all countably dimensional U leq E, we have dim(U^perp) leq omega. Blass showed that the Specker phenomenon is closely related to a combinatorial phenomenon he called evading and predicting. We prove several additional results (both theorems of ZFC and independence proofs) about evading and predicting as well as se, and relate a Luzin--style property associated with evading to the existence of strong Gross spaces.

Explore related subjects

math.LO

Keep this discovery

BibTeXRIS

Jörg Brendle. 1993-09-09. Evasion and prediction --- the Specker phenomenon and Gross spaces. https://arxiv.org/abs/math/9309204

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗