Search arXivSearch

arXiv · 2001.05338

Fences, their endpoints, and projective Fra\"iss\'e theory

Abstract

We introduce a new class of compact metrizable spaces, which we call fences, and its subclass of smooth fences. We isolate two families $\mathcal F, \mathcal F_0$ of Hasse diagrams of finite partial orders and show that smooth fences are exactly the spaces which are approximated by projective sequences from $\mathcal F_0$. We investigate the combinatorial properties of Hasse diagrams of finite partial orders and show that $\mathcal F, \mathcal F_0$ are projective Fra\"iss\'e families with a common projective Fra\"iss\'e limit. We study this limit and characterize the smooth fence obtained as its quotient, which we call a Fra\"iss\'e fence. We show that the Fra\"iss\'e fence is a highly homogeneous space which shares several features with the Lelek fan, and we examine the structure of its spaces of endpoints. Along the way we establish some new facts in projective Fra\"iss\'e theory.

Explore related subjects

Keep this discovery

BibTeXRIS

Gianluca Basso, Riccardo Camerlo. 2020-01-15. Fences, their endpoints, and projective Fra\"iss\'e theory. https://doi.org/10.1090/tran/8366

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