SearcharxivSearch

arXiv · 2509.05872

Hyper swap structures and Kalman functors: the case study of da Costa logic $C_ω$

Abstract

In a previous paper, we recast Morgado hyperlattices and Sette implicative hyperlattices in lattice-theoretic terms. By utilizing swap structures induced by implicative lattices, we obtained a direct proof of soundness and completeness for da Costa's paraconsistent logic $C_ω$ with respect to Sette's hyperalgebraic semantics. Inspired by Kalman functors in the context of twist structures, we introduce the notion of hyper swap structures, a novel class of hyperalgebras that naturally generalize swap structure semantics. We prove that these hyperalgebras, besides providing another class of hyperalgebraic models for $C_ω$, induce a Kalman-style functor between the category of Sette implicative hyperlattices and the category of enriched hyperalgebras for $C_ω$. Specifically, we exhibit an equivalence of categories between Sette implicative hyperlattices and their enriched hyperalgebraic counterparts using Kalman and forgetful functors. Similar results are extended to two axiomatic extensions of $C_ω$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Marcelo E. Coniglio, Kaique Roberto, Ana Claudia Golzio. 2025-10-01. Hyper swap structures and Kalman functors: the case study of da Costa logic $C_ω$. https://arxiv.org/abs/2509.05872

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