SearcharxivSearch

arXiv · 2608.26084

Localic Esakia Duality via Conic Frames

Abstract

Esakia duality is the dual equivalence between Heyting algebras and Esakia spaces. However, the traditional proof uses the Prime Ideal Theorem to recover the algebra from its spectrum, a choice principle that is not constructively valid. We build on Townsend's localic Priestley duality to describe a fully constructive, localic Esakia duality. On the algebraic side, we use the recently introduced Heyting frames as the point-free version of Heyting algebras. On the spatial side, Esakia spaces are modeled by two point-free alternatives. First, Esakia locales are defined as a subclass of the ordered Stone locales introduced by Townsend, and it is shown directly that Townsend's equivalence restricts to a duality between Heyting frames and Esakia locales. Second, using the theory of conic frames, in which join-preserving closure operators on frames model localic preorders, we introduce Esakia frames as a frame-theoretic analogue of Esakia spaces. It is shown that Esakia frames are equivalent to Heyting frames and dually equivalent to Esakia locales, and that this factorises the restriction of Townsend's equivalence. This yields a fully constructive, localic Esakia duality.

Explore related subjects

Keep this discovery

BibTeXRIS

Nesta van der Schaaf. 2026-08-26. Localic Esakia Duality via Conic Frames. https://arxiv.org/abs/2608.26084

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