Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · math/9311205

Applications of cohomology to questions in set theory i: hausdorff gaps

Daniel Talayco
View original source ↗Read source document ↗Export metadata ↓

Abstract

We explore an application of homological algebra to set theoretic objects by developing a cohomology theory for Hausdorff gaps. The cohomology theory is introduced with enough generality to be applicable to other questions in set theory. For gaps, this leads to a natural equivalence notion about which we answer questions by constructing many simultaneous gaps. The first result is proved by constructing countably many gaps such that the union of any combination corresponding to a subset of $\omega$ is again a gap. This is done in ZFC. New combinatorial hypotheses related to club ($\clubsuit$) are introduced to prove the second result which increases the number of gaps to $\aleph_1$. The presentation of these results does not depend on the development of the cohomology theory. Additionally, the notion of an incollapsible gap is introduced and the existence of such a gap is shown to be independent of ZFC.

Explore related subjects

math.LO

Keep this discovery

BibTeXRIS

Daniel Talayco. 1993-11-15. Applications of cohomology to questions in set theory i: hausdorff gaps. https://arxiv.org/abs/math/9311205

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↗