Subtractive logic - Archive ouverte HAL Access content directly
Journal Articles Theoretical Computer Science Year : 2001

Subtractive logic


This paper is the first part of a work whose purpose is to investigate duality in some related frameworks (cartesian closed categories, lambda-calculi, intuitionistic and classical logics) from syntactic, semantical and computational viewpoints. We start with category theory and we show that any bicartesian closed category with coexponents is degenerated (i.e. there is at most one arrow between two objects). The remainder of the paper is devoted to logical issues. We examine the propositional calculus underlying the type system of bicartesian closed categories with coexponents and we show that this calculus corresponds to subtractive logic: a conservative extension of intuitionistic logic with a new connector (subtraction) dual to implication. Eventually, we consider first order subtractive logic and we present an embedding of classical logic into subtractive logic.
No file

Dates and versions

hal-00094589 , version 1 (14-09-2006)


  • HAL Id : hal-00094589 , version 1


Tristan Crolard. Subtractive logic. Theoretical Computer Science, 2001, 254:1-2, pp.151-185. ⟨hal-00094589⟩


84 View
0 Download


Gmail Facebook Twitter LinkedIn More