Search arXivSearch

arXiv · 1204.5124

The (\lambda, \kappa)-Freese-Nation property for boolean algebras and compacta

Abstract

We study a two-parameter generalization of the Freese-Nation Property of boolean algebras and its order-theoretic and topological consequences. For every regular infinite \kappa, the (\kappa,\kappa)-FN, the (\kappa^+,\kappa)-FN, and the \kappa-FN are known to be equivalent; we show that the family of properties (\lambda,\mu)-FN for \lambda>\mu form a true two-dimensional hierarchy that is robust with respect to coproducts, retracts, and the exponential operation. The (\kappa,\aleph_0)-FN in particular has strong consequences for base properties of compacta (stronger still for homogeneous compacta), and these consequences have natural duals in terms of special subsets of boolean algebras. We show that the (\kappa,\aleph_0)-FN also leads to a generalization of the equality of weight and \pi-character in dyadic compacta. Elementary subalgebras and their duals, elementary quotient spaces, were originally used to define the (\lambda, \kappa)-FN and its topological dual, which naturally generalized from Stone spaces to all compacta, thereby generalizing Shchepin's notion of openly generated compacta. We introduce a simple combinatorial definition of the (\lambda, \kappa)-FN that is equivalent to the original for regular infinite cardinals \lambda>\kappa.

Explore related subjects

Keep this discovery

BibTeXRIS

David Milovich. 2012-04-23. The (\lambda, \kappa)-Freese-Nation property for boolean algebras and compacta. https://arxiv.org/abs/1204.5124

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