Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2301.05661

Choice-free Dualities for Lattice Expansions: Application to Logics with a Negation Operator

Chrysafis Hartonas
View original source ↗Read source document ↗Export metadata ↓

Abstract

Constructive dualities have been recently proposed for some lattice based algebras and a related project has been outlined by Holliday and Bezhanishvili, aiming at obtaining "choice-free spatial dualities for other classes of algebras [$\ldots$], giving rise to choice-free completeness proofs for non-classical logics''. We present in this article a way to complete the Holliday-Bezhanishvili project (uniformly, for any normal lattice expansion) by recasting recent relational representation and duality results in a choice-free manner. These results have some affinity with the Moshier and Jipsen duality for bounded lattices with quasi-operators, except for aiming at representing operators by relations, extending the J\'{o}nsson-Tarski approach for BAOs, and Dunn's follow up approach for distributive gaggles, to contexts where distribution may not be assumed. To illustrate, we apply the framework to lattices (and their logics) with some form or other of a (quasi)complementation operator, obtaining canonical extensions in relational frames and choice-free dualities for lattices with a minimal, or a Galois quasi-complement, or involutive lattices, including De Morgan algebras, as well as Ortholattices and Boolean algebras, as special cases.

Explore related subjects

math.LOcs.LO

Keep this discovery

BibTeXRIS

Chrysafis Hartonas. 2023-01-13. Choice-free Dualities for Lattice Expansions: Application to Logics with a Negation Operator. https://arxiv.org/abs/2301.05661

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↗