A hierarchy of clopen graphs on the Baire space

Arnold W. Miller

Home/Archive/arXiv

arXiv · 1210.8362

A hierarchy of clopen graphs on the Baire space

Arnold W. Miller

View original source ↗Read source document ↗Export metadata ↓

Abstract

We say that binary relation E on a space X is a clopen graph on X iff E is symmetric and irreflexive and clopen relative to X x X minus its diagonal. Equivalently for distinct x, y in X there are open sets U,V with (x,y) in U x V and either U x V a subset of E or U x V a subset of E complement. For clopen graphs E_1 and E_2 on the Baire space (omega^omega) we say that E_1 continuously reduces to E_2 iff there is a continuous map f from the Baire space to itself such that for [(x,y) in E_1 iff (f(x),f(y)) in E_2 ] for distinct x,y. Note that f need not be one-to-one but there should be no edges in the preimage of a point. If f is a homeomorphism to its image, then we say that E_1 continuously embeds into E_2. Theorem. There does not exist countably many clopen graphs on the Baire space such that every clopen graph on the Baire space continuously reduces to one of them. However there does exists omega_1 clopen graphs on such that every clopen graph continuously embedds into one of them. This answers a question of Stefan Geschke. Latex2e: 9 pages Latest version at: www.math.wisc.edu/~miller

Explore related subjects

math.LO

Keep this discovery

BibTeX RIS

Arnold W. Miller. 2012-10-31. A hierarchy of clopen graphs on the Baire space. https://arxiv.org/abs/1210.8362

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↗