SearcharxivSearch

arXiv · 2503.05364

Classical Logic as Intuitionistic Logic with Duality

Abstract

The field of proof-theoretic semantics (P-tS) offers an alternative approach to meaning in logic that is based on inference and argument (rather than truth in a model). It has been successfully developed for various logics; in particular, Sandqvist has developed such semantics for both classical and intuitionistic logic. In the case of classical logic, P-tS provides a conception of consequence that avoids an a priori commitment to the principle of bivalence, addressing what Dummett identified as a significant foundational challenge in logic. In this paper, we propose an alternative P-tS for classical logic, which essentially extends the P-tS for intuitionistic logic by operating over literals rather than atomic propositions. Importantly, literals are atomic and not defined by negation but are related by a primitive duality encoded inferentially at the atomic level. This semantics illustrates the perspective that classical logic can be understood as intuitionistic logic supplemented by a principle of duality, offering fresh insights into the relationship between these two systems.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alexander V. Gheorghiu, Yll Buzoku. 2025-03-07. Classical Logic as Intuitionistic Logic with Duality. https://arxiv.org/abs/2503.05364

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