SearcharxivSearch

arXiv · 2606.29954

Fundamental Logic Through the Lens of Modality

Abstract

Fundamental logic is a non-classical logic based only on the introduction and elimination rules for conjunction, disjunction, negation, and the quantifiers in a Fitch-style natural deduction system. In this paper, we attempt to obtain a better understanding of fundamental logic and its semantics through the lens of modality. Using modal logic, we develop means of mutual understanding between the fundamental logician, on the one hand, and the orthologician and intuitionistic logician, on the other: we prove that the G\"odel-McKinsey-Tarski (GMT) translation of intuitionistic logic into the classical modal logic $\mathsf{S4}$ is a full and faithful embedding of fundamental logic into the orthological version of $\mathsf{S4}$; that the Goldblatt translation of orthologic into the classical modal logic $\mathsf{KTB}$ is a full and faithful embedding of fundamental logic into an intuitionistic version of $\mathsf{KTB}$; and that the GMT translation is a full and faithful embedding of intuitionistic logic into a modal extension of fundamental logic.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Wesley H. Holliday, Guillaume Massas. 2026-06-29. Fundamental Logic Through the Lens of Modality. https://arxiv.org/abs/2606.29954

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