Dialectica Categories over Heyting Algebras

Colin Bloomfield; Peter Jipsen; Valeria de Paiva

Home/Archive/arXiv

arXiv · 2607.23430

Dialectica Categories over Heyting Algebras

Colin Bloomfield·Peter Jipsen·Valeria de Paiva

View original source ↗Read source document ↗Export metadata ↓

Abstract

Categorification---the process of constructing a categorical model of a piece of mathematics---often identifies a common abstraction that connects formerly unrelated but known structures. In the case of de Paiva's categorification of G\"odel's Dialectica interpretation, we find that its specialization to partial orders produces (functorial) embeddings of Heyting algebras into residuated lattices that appear to have been overlooked. For the non-categorical audience, we present this specialization and take care to reproduce the original proofs in the algebraic setting. Along the way we obtain results particular to this algebraic setting: an embedding lacking an evident adjoint in de Paiva's general construction acquires a definable one here; a single Dialectica tensor validates contraction in the intuitionistic construction D yet refutes it in the classical variant G; and, over ZF, the poset reflection PD(Set) collapses onto the four-element algebra PD(2) exactly when the Axiom of Choice holds.

Explore related subjects

math.LO cs.LO math.CT

Keep this discovery

BibTeX RIS

Colin Bloomfield, Peter Jipsen, Valeria de Paiva. 2026-07-26. Dialectica Categories over Heyting Algebras. https://arxiv.org/abs/2607.23430

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↗