Subtractive logic

Abstract : 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.
Document type :
Journal articles
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00094589
Contributor : Tristan Crolard <>
Submitted on : Thursday, September 14, 2006 - 4:49:47 PM
Last modification on : Friday, April 12, 2019 - 10:18:09 AM

Identifiers

  • HAL Id : hal-00094589, version 1

Collections

Citation

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

Share

Metrics

Record views

63