SearcharxivSearch

arXiv · 2503.16651

Fundamental Propositional Logic with Strict Implication

Abstract

Fundamental logic was introduced by Wesley Holliday (2023) to unify intuitionistic logic and quantum logic from a proof-theoretic perspective, capturing the logic determined solely by the introduction and elimination rules of connectives $\neg$, $\wedge$, $\vee$. This paper incorporates strict implication -- standard in intuitionistic logic and a significant candidate for quantum logic -- into the framework of fundamental propositional logic. We demonstrate that, unlike the original language, the presence of strict implication causes the semantic consequence relations over pseudo-reflexive pseudo-symmetric frames and reflexive pseudo-symmetric frames to diverge. Consequently, we provide separate axiomatizations for these two logics in the language $\{\perp, \wedge, \vee, \rightarrow\}$. Soundness and completeness theorems are established for both systems.

Explore related subjects

Keep this discovery

BibTeXRIS

Zhicheng Chen. 2025-03-20. Fundamental Propositional Logic with Strict Implication. https://arxiv.org/abs/2503.16651

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