Connecting semantics for intuitionistic and classical logic operators
Connecting Base-Extension Semantics, Beth Semantics, and Ecumenical Logic
Logic in Computer Science
Summary
This paper explores how different ways of understanding logical statements relate to each other, particularly intuitionistic and classical logic. The authors show a way to interpret both types of logic operators within a single framework without converting one into the other. They also find conditions under which certain semantic rules identify classical logic features. Their work clarifies how adding certain rules changes the meaning of logical operators when interpretations are restricted to consistent scenarios.
What this means in practice
- •For logic system designers: Design unified logic frameworks that handle both intuitionistic and classical operators without relying on translations.
- •For automated reasoning engineers: Develop reasoning systems that more precisely characterize classical reasoning within base-extension semantic frameworks.
A theory result. No direct application yet.
Authors
Victor Barroso-Nascimento, Joaquim T. Waddington, Elaine Pimentel
Abstract
We investigate the relationship between base-extension semantics, Beth semantics, and Prawitz's ecumenical logic. We first present a base-extension semantics for the propositional fragment of Prawitz's system and prove that it is sound and complete. The semantics interprets intuitionistic and classical operators directly within a common proof-theoretic framework, without reducing the classical operators to their intuitionistic counterparts by means of a translation. We then analyse the effect of incorporating Beth-style clauses into base-extension semantics. When arbitrary bases are admitted and $\bot$ is governed by atomic explosion, these clauses trivialise. By contrast, when $\bot$ is treated as a basic sentence and attention is restricted to consistent bases, the Beth-style clauses for atoms and disjunction characterise, respectively, classical atoms and classical disjunction in Prawitz's system. We also obtain equivalent, path-independent formulations of the classical clauses for atoms, disjunction, and implication. These results reveal that the consistency constraint is not merely a technical restriction: within base-extension semantics, it transforms clauses originally associated with intuitionistic semantics into semantic characterisations of classical operators.