Results 1  10
of
26
Simple Consequence Relations
 Information and Computation
, 1991
"... We provide a general investigation of Logic in which the notion of a simple consequence relation is taken to be fundamental. Our notion is more general than the usual one since we give up monotonicity and use multisets rather than sets. We use our notion for characterizing several known logics (incl ..."
Abstract

Cited by 100 (18 self)
 Add to MetaCart
We provide a general investigation of Logic in which the notion of a simple consequence relation is taken to be fundamental. Our notion is more general than the usual one since we give up monotonicity and use multisets rather than sets. We use our notion for characterizing several known logics (including Linear Logic and nonmonotonic logics) and for a general, semanticsindependent classification of standard connectives via equations on consequence relations (these include Girard's "multiplicatives" and "additives"). We next investigate the standard methods for uniformly representing consequence relations: Hilbert type, Natural Deduction and Gentzen type. The advantages and disadvantages of using each system and what should be taken as good representations in each case (especially from the implementation point of view) are explained. We end by briefly outlining (with examples) some methods for developing nonuniform, but still efficient, representations of consequence relations.
Decision Problems for Propositional Linear Logic
, 1990
"... Linear logic, introduced by Girard, is a refinement of classical logic with a natural, intrinsic accounting of resources. We show that unlike most other propositional (quantifierfree) logics, full propositional linear logic is undecidable. Further, we prove that without the modal storage operator, ..."
Abstract

Cited by 90 (17 self)
 Add to MetaCart
Linear logic, introduced by Girard, is a refinement of classical logic with a natural, intrinsic accounting of resources. We show that unlike most other propositional (quantifierfree) logics, full propositional linear logic is undecidable. Further, we prove that without the modal storage operator, which indicates unboundedness of resources, the decision problem becomes pspacecomplete. We also establish membership in np for the multiplicative fragment, npcompleteness for the multiplicative fragment extended with unrestricted weakening, and undecidability for certain fragments of noncommutative propositional linear logic. 1 Introduction Linear logic, introduced by Girard [14, 18, 17], is a refinement of classical logic which may be derived from a Gentzenstyle sequent calculus axiomatization of classical logic in three steps. The resulting sequent system Lincoln@CS.Stanford.EDU Department of Computer Science, Stanford University, Stanford, CA 94305, and the Computer Science Labo...
A Brief Guide to Linear Logic
, 1993
"... An overview of linear logic is given, including an extensive bibliography and a simple example of the close relationship between linear logic and computation. ..."
Abstract

Cited by 53 (8 self)
 Add to MetaCart
An overview of linear logic is given, including an extensive bibliography and a simple example of the close relationship between linear logic and computation.
A Generalization of Analytic Deduction via Labelled Deductive Systems I: Basic Substructural Logics
 Journal of Automated Reasoning
, 1995
"... In this series of papers we set out to generalize the notion of classical analytic deduction (i.e. deduction via elimination rules) by combining the methodology of Labelled Deductive Systems [Gab94] with the classical system KE [DM94]. LDS is a unifying framework for the study of logics and of their ..."
Abstract

Cited by 50 (10 self)
 Add to MetaCart
In this series of papers we set out to generalize the notion of classical analytic deduction (i.e. deduction via elimination rules) by combining the methodology of Labelled Deductive Systems [Gab94] with the classical system KE [DM94]. LDS is a unifying framework for the study of logics and of their interactions. In the LDS approach the basic units of logical derivation are not just formulae but labelled formulae, where the labels belong to a given "labelling algebra". The derivation rules act on the labels as well as on the formulae, according to certain fixed rules of propagation. By virtue of the extra power of the labelling algebras, standard (classical or intuitionistic) proof systems can be extended to cover a much wider territory without modifying their structure. The system KE is a new tree method for classical analytic deduction based on "analytic cut". It is a refutation system, like analytic tableaux and resolution, but it is essentially more efficient than tableaux and, un...
Natural 3valued Logics  Characterization and Proof Theory
 Journal of Symbolic Logic
, 1991
"... Introduction Manyvalued logics in general and 3valued logic in particular is an old subject which had its beginning in the work of Lukasiewicz [Luk]. Recently there is a revived interest in this topic, both for its own sake (see, e.g. [Ho]), and also because of its potential applications in sever ..."
Abstract

Cited by 43 (16 self)
 Add to MetaCart
Introduction Manyvalued logics in general and 3valued logic in particular is an old subject which had its beginning in the work of Lukasiewicz [Luk]. Recently there is a revived interest in this topic, both for its own sake (see, e.g. [Ho]), and also because of its potential applications in several areas of computer science, like: proving correctness of programs ([Jo]), knowledge bases ([CP]) and Artificial Intelligence ([Tu]). There are, however, a huge number of 3valued systems which logicians have studied throughout the years. The motivation behind them and their properties are not always clear and their proof theory is frequently not well developed. This state of affairs makes both the use of 3valued logics and doing fruitful research on them rather difficult. Our first goal in this work is, accordingly, to identify and characterize a class of 3valued logics which might be called natural. For this we use the general framework for characterizing and inve
Geometry of Interaction and Linear Combinatory Algebras
, 2000
"... this paper was quite di#erent, stemming from the axiomatics of categories of tangles (although the authors were aware of possible connections to iteration theories. In fact, similar axiomatics in the symmetric case, motivated by flowcharts and "flownomials" had been developed some years earlier by S ..."
Abstract

Cited by 43 (10 self)
 Add to MetaCart
this paper was quite di#erent, stemming from the axiomatics of categories of tangles (although the authors were aware of possible connections to iteration theories. In fact, similar axiomatics in the symmetric case, motivated by flowcharts and "flownomials" had been developed some years earlier by Stefanescu (Stefanescu 2000).) However, the first author realized, following a stimulating discussion with Gordon Plotkin, that traced monoidal categories provided a common denominator for the axiomatics of both the Girardstyle and AbramskyJagadeesanstyle versions of the Geometry of Interaction, at the basic level of the multiplicatives. This insight was presented in (Abramsky 1996), in which Girardstyle GoI was dubbed "particlestyle", since it concerns information particles or tokens flowing around a network, while the AbramskyJagadeesan style GoI was dubbed "wavestyle", since it concerns the evolution of a global information state or "wave". Formally, this distinction is based on whether the tensor product (i.e. the symmetric monoidal structure) in the underlying category is interpreted as a coproduct (particle style) or as a product (wave style). This computational distinction between coproduct and product interpretations of the same underlying network geometry turned out to have been partially anticipated, in a rather di#erent context, in a pioneering paper by E. S. Bainbridge (Bainbridge 1976), as observed by Dusko Pavlovic. These two forms of interpretation, and ways of combining them, have also been studied recently in (Stefanescu 2000). He uses the terminology "additive" for coproductbased (i.e. our "particlestyle") and "multiplicative" for productbased (i.e. our "wavestyle"); this is not suitable for our purposes, because of the clash with Linear Logic term...
Proof Search Issues In Some NonClassical Logics
, 1998
"... This thesis develops techniques and ideas on proof search. Proof search is used with one of two meanings. Proof search can be thought of either as the search for a yes/no answer to a query (theorem proving), or as the search for all proofs of a formula (proof enumeration). This thesis is an investig ..."
Abstract

Cited by 37 (1 self)
 Add to MetaCart
This thesis develops techniques and ideas on proof search. Proof search is used with one of two meanings. Proof search can be thought of either as the search for a yes/no answer to a query (theorem proving), or as the search for all proofs of a formula (proof enumeration). This thesis is an investigation into issues in proof search in both these senses for some nonclassical logics. Gentzen systems are well suited for use in proof search in both senses. The rules of Gentzen sequent calculi are such that implementations can be directed by the top level syntax of sequents, unlike other logical calculi such as natural deduction. All the calculi for proof search in this thesis are Gentzen sequent calculi. In Chapter 2, permutation of inference rules for Intuitionistic Linear Logic is studied. A focusing calculus, ILLF, in the style of Andreoli ([And92]) is developed. This calculus allows only one proof in each equivalence class of proofs equivalent up to permutations of inferences. The issue here is both theorem proving and proof enumeration. For certain logics, normal natural deductions provide a prooftheoretic semantics. Proof enumeration is then the enumeration of all these deductions. Herbelin's cutfree LJT ([Her95], here called MJ) is a Gentzen system for intuitionistic logic allowing derivations that correspond in a 11 way to the normal natural deductions of intuitionistic logic. This calculus is therefore well suited to proof enumeration. Such calculi are called `permutationfree' calculi. In Chapter 3, MJ is extended to a calculus for an intuitionistic modal logic (due to Curry) called Lax Logic. We call this calculus PFLAX. The proof theory of MJ is extended to PFLAX. Chapter 4 presents work on theorem proving for propositional logics using a history mechanism f...
A Relevant Analysis of Natural Deduction
 Journal of Logic and Computation
, 1999
"... Linear and other relevant logics have been studied widely in mathematical, philosophical and computational logic. We describe a logical framework, RLF, for defining natural deduction presentations of such logics. RLF consists in a language together, in a manner similar to that of Harper, Honsell and ..."
Abstract

Cited by 23 (7 self)
 Add to MetaCart
Linear and other relevant logics have been studied widely in mathematical, philosophical and computational logic. We describe a logical framework, RLF, for defining natural deduction presentations of such logics. RLF consists in a language together, in a manner similar to that of Harper, Honsell and Plotkin's LF, with a representation mechanism: the language of RLF is the lLcalculus; the representation mechanism is judgementsastypes, developed for relevant logics. The lLcalculus type theory is a firstorder dependent type theory with two kinds of dependent function spaces: a linear one and an intuitionistic one. We study a natural deduction presentation of the type theory and establish the required prooftheoretic metatheory. The RLF framework is a conservative extension of LF. We show that RLF uniformly encodes (fragments of) intuitionistic linear logic, Curry's l I calculus and ML with references. We describe the CurryHowardde Bruijn correspondence of the lLcalculus with a s...
A Structural Approach to Reversible Computation
 Theoretical Computer Science
, 2001
"... Reversibility is a key issue in the interface between computation and physics, and of growing importance as miniaturization progresses towards its physical limits. Most foundational work on reversible computing to date has focussed on simulations of lowlevel machine models. By contrast, we develop ..."
Abstract

Cited by 18 (3 self)
 Add to MetaCart
Reversibility is a key issue in the interface between computation and physics, and of growing importance as miniaturization progresses towards its physical limits. Most foundational work on reversible computing to date has focussed on simulations of lowlevel machine models. By contrast, we develop a more structural approach. We show how highlevel functional programs can be mapped compositionally (i.e. in a syntaxdirected fashion) into a simple kind of automata which are immediately seen to be reversible. The size of the automaton is linear in the size of the functional term. In mathematical terms, we are building a concrete model of functional computation. This construction stems directly from ideas arising in Geometry of Interaction and Linear Logicâ€”but can be understood without any knowledge of these topics. In fact, it serves as an excellent introduction to them. At the same time, an interesting logical delineation between reversible and irreversible forms of computation emerges from our analysis. 1
Constructive Logics. Part II: Linear Logic and Proof Nets
 Proceedings of the International Joint Conference and Symposium on Logic Programming
, 1997
"... . The purpose of this paper is to give an exposition of material dealing with constructive logics, typed calculi, and linear logic. The first part of this paper gives an exposition of background material (with a few exceptions). This second part is devoted to linear logic and proof nets. Particular ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
. The purpose of this paper is to give an exposition of material dealing with constructive logics, typed calculi, and linear logic. The first part of this paper gives an exposition of background material (with a few exceptions). This second part is devoted to linear logic and proof nets. Particular attention is given to the algebraic semantics (in Girard's terminology, phase semantics) of linear logic. We show how phase spaces arise as an instance of a Galois connection. We also give a direct proof of the correctness of the DanosRegnier criterion for proof nets. This proof is based on a purely graphtheoretic decomposition lemma. As a corollary, we give an O(n 2 )time algorithm for testing whether a proof net is correct. Although the existence of such an algorithm has been announced by Girard, our algorithm appears to be original. This research was partially supported by ONR Grant NOOO1488K0593. Contents 1 Core Linear Logic and Propositional Linear Logic 3 2 Representing I...