Results 1  10
of
14
A formulaeastypes interpretation of subtractive logic
 Journal of Logic and Computation
, 2004
"... We present a formulaeastypes interpretation of Subtractive Logic (i.e. biintuitionistic logic). This presentation is twofold: we first define a very natural restriction of the λµcalculus which is closed under reduction and whose type system is a constructive restriction of the Classical Natural ..."
Abstract

Cited by 23 (1 self)
 Add to MetaCart
We present a formulaeastypes interpretation of Subtractive Logic (i.e. biintuitionistic logic). This presentation is twofold: we first define a very natural restriction of the λµcalculus which is closed under reduction and whose type system is a constructive restriction of the Classical Natural Deduction. Then we extend this deduction system conservatively to Subtractive Logic. From a computational standpoint, the resulting calculus provides a type system for firstclass coroutines (a restricted form of firstclass continuations). Keywords: CurryHoward isomorphism, Subtractive Logic, control operators, coroutines. 1
Subtractive Logic
, 1999
"... This paper is the first part of a work whose purpose is to investigate duality in some related frameworks (cartesian closed categories, lambdacalculi, intuitionistic and classical logics) from syntactic, semantical and computational viewpoints. We start with category theory and we show that any ..."
Abstract

Cited by 20 (1 self)
 Add to MetaCart
This paper is the first part of a work whose purpose is to investigate duality in some related frameworks (cartesian closed categories, lambdacalculi, 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. Introduction This paper is the first part of a work whose purpose is to investigate duality in some related ...
Cutelimination and proofsearch for biintuitionistic logic using nested sequents
, 2008
"... We propose a new sequent calculus for biintuitionistic logic which sits somewhere between display calculi and traditional sequent calculi by using nested sequents. Our calculus enjoys a simple (purely syntactic) cutelimination proof as do display calculi. But it has an easily derivable variant cal ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
We propose a new sequent calculus for biintuitionistic logic which sits somewhere between display calculi and traditional sequent calculi by using nested sequents. Our calculus enjoys a simple (purely syntactic) cutelimination proof as do display calculi. But it has an easily derivable variant calculus which is amenable to automated proof search as are (some) traditional sequent calculi. We first present the initial calculus and its cutelimination proof. We then present the derived calculus, and then present a proofsearch strategy which allows it to be used for automated proof search. We prove that this search strategy is terminating and complete by showing how it can be used to mimic derivations obtained from an existing calculus GBiInt for biintuitionistic logic. As far as we know, our new calculus is the first sequent calculus for biintuitionistic logic which uses no semantic additions like labels, which has a purely syntactic cutelimination proof, and which can be used naturally for backwards proofsearch.
Dual intuitionistic logic revisited
 Automated Reasoning with Analytic Tableaux and Related Methods, St
, 2000
"... Abstract. We unify the algebraic, relational and sequent methods used by various authors to investigate “dual intuitionistic logic”. We show that restricting sequents to “singletons on the left/right ” cannot capture “intuitionistic logic with dual operators”, the natural hybrid logic that arises fr ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
Abstract. We unify the algebraic, relational and sequent methods used by various authors to investigate “dual intuitionistic logic”. We show that restricting sequents to “singletons on the left/right ” cannot capture “intuitionistic logic with dual operators”, the natural hybrid logic that arises from intuitionistic and dualintuitionistic logic. We show that a previously reported generalised display framework does deliver the required cutfree display calculus. We also pinpoint precisely the structural rule necessary to turn this display calculus into one for classical logic. 1
Combining Derivations and Refutations for Cutfree Completeness in BiIntuitionistic Logic
, 2008
"... Biintuitionistic logic is the union of intuitionistic and dual intuitionistic logic, and was introduced by Rauszer as a Hilbert calculus with algebraic and Kripke semantics. But her subsequent “cutfree ” sequent calculus has recently been shown to fail cutelimination. We present a new cutfree se ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
Biintuitionistic logic is the union of intuitionistic and dual intuitionistic logic, and was introduced by Rauszer as a Hilbert calculus with algebraic and Kripke semantics. But her subsequent “cutfree ” sequent calculus has recently been shown to fail cutelimination. We present a new cutfree sequent calculus for biintuitionistic logic, and prove it sound and complete with respect to its Kripke semantics. Ensuring completeness is complicated by the interaction between intuitionistic implication and dual intuitionistic exclusion, similarly to future and past modalities in tense logic. Our calculus handles this interaction using derivations and refutations as first class citizens. We employ extended sequents which pass information from premises to conclusions using variables instantiated at the leaves of refutations, and rules which compose certain refutations and derivations to form derivations. Automated deduction using terminating backward search is also possible, although this is not our main purpose. 1
On logics with coimplication
 Journal of Philosophical Logic
, 1998
"... This paper investigates (modal) extensions of HeytingBrouwer logic, i.e., the logic which results when the dual of implication (alias coimplication) is added to the language of intuitionistic logic. We rst develop matrix as well as Kripke style semantics for those logics. Then, by extending the God ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
This paper investigates (modal) extensions of HeytingBrouwer logic, i.e., the logic which results when the dual of implication (alias coimplication) is added to the language of intuitionistic logic. We rst develop matrix as well as Kripke style semantics for those logics. Then, by extending the Godelembedding of intuitionistic logic into S4, itisshown that all (modal) extensions of HeytingBrouwer logic can be embedded into tense logics (with additional modal operators). An extension of the BlokEsakiaTheorem is proved for this embedding. 1
A cutfree sequent calculus for biintuitionistic logic: extended version
, 2007
"... Abstract. Biintuitionistic logic is the extension of intuitionistic logic with a connective dual to implication. Biintuitionistic logic was introduced by Rauszer as a Hilbert calculus with algebraic and Kripke semantics. But her subsequent “cutfree ” sequent calculus for BiInt has recently been s ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Abstract. Biintuitionistic logic is the extension of intuitionistic logic with a connective dual to implication. Biintuitionistic logic was introduced by Rauszer as a Hilbert calculus with algebraic and Kripke semantics. But her subsequent “cutfree ” sequent calculus for BiInt has recently been shown by Uustalu to fail cutelimination. We present a new cutfree sequent calculus for BiInt, and prove it sound and complete with respect to its Kripke semantics. Ensuring completeness is complicated by the interaction between implication and its dual, similarly to future and past modalities in tense logic. Our calculus handles this interaction using extended sequents which pass information from premises to conclusions using variables instantiated at the leaves of failed derivation trees. Our simple termination argument allows our calculus to be used for automated deduction, although this is not its main purpose. 1
AntiIntuitionism and Paraconsistency
 URL = http://www.cle.unicamp.br/eprints/vol 3,n 1,2003.html
, 2003
"... This paper aims to help to elucidate some questions on the duality between the intuitionistic and the paraconsistent paradigms of thought, proposing some new classes of antiintuitionistic propositional logics and investigating their relationships with the original intuitionistic logics. It is s ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
This paper aims to help to elucidate some questions on the duality between the intuitionistic and the paraconsistent paradigms of thought, proposing some new classes of antiintuitionistic propositional logics and investigating their relationships with the original intuitionistic logics. It is shown here that antiintuitionistic logics are paraconsistent, and in particular we develop a first antiintuitionistic hierarchy starting with Johansson 's dual calculus and ending up with Godel's threevalued dual calculus, showing that no calculus of this hierarchy allows the introduction of an internal implication symbol. Comparing these antiintuitionistic logics with wellknown paraconsistent calculi, we prove that they do not coincide with any of these. On the other hand, by dualizing the hierarchy of the paracomplete (or maximal weakly intuitionistic) manyvalued )n## we show that the antiintuitionistic hierarchy (I )n## obtained from (I )n## does coincide with the hierarchy of the manyvalued paraconsistent logics (P )n## . Fundamental properties of our method are investigated, and we also discuss some questions on the duality between the intuitionistic and the paraconsistent paradigms, including the problem of selfduality. We argue that questions of duality quite naturally require refutative systems (which we call elenctic systems) as well as the usual demonstrative systems (which we call deictic systems), and multipleconclusion logics are used as an appropriate environment to deal with them.
A constructive restriction of the λµcalculus
, 1999
"... We define a very natural restriction of the λµcalculus which is stable under reduction and whose type system is a restriction of the Classical Natural Deduction to intuitionistic logic. However, we show that this system is in some sense degenerated unless we provide a native disjunction. We prove t ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We define a very natural restriction of the λµcalculus which is stable under reduction and whose type system is a restriction of the Classical Natural Deduction to intuitionistic logic. However, we show that this system is in some sense degenerated unless we provide a native disjunction. We prove that the system with native disjunction is conservative over DISlogic and also that DISlogic is constructive. From a computational standpoint, this restriction on λµterms prevents a coroutine from accessing the local environment of another coroutine.
A Connectionbased Characterization of Biintuitionistic Validity
"... Abstract. We give a connectionbased characterization of validity in propositional biintuitionistic logic in terms of speci c directed graphs called Rgraphs. Such a characterization is wellsuited for deriving labelled proofsystems with countermodel construction facilities. We rst de ne the noti ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. We give a connectionbased characterization of validity in propositional biintuitionistic logic in terms of speci c directed graphs called Rgraphs. Such a characterization is wellsuited for deriving labelled proofsystems with countermodel construction facilities. We rst de ne the notion of biintuitionistic Rgraph from which we then obtain a connectionbased characterization of propositional biintuitionistic validity and derive a sound and complete freevariable labelled sequent calculus that admits cutelimination and also variable splitting. 1