Results for 'linear logic'

1000+ found
Order:
  1. A Comparison between two Different Tarski-style Semantics for Linear Logic.Linear Logic & M. Piazza - 1994 - Epistemologia 17 (1):101-116.
     
    Export citation  
     
    Bookmark  
  2.  32
    Quantized linear logic, involutive quantales and strong negation.Norihiro Kamide - 2004 - Studia Logica 77 (3):355-384.
    A new logic, quantized intuitionistic linear logic, is introduced, and is closely related to the logic which corresponds to Mulvey and Pelletier's involutive quantales. Some cut-free sequent calculi with a new property quantization principle and some complete semantics such as an involutive quantale model and a quantale model are obtained for QILL. The relationship between QILL and Wansing's extended intuitionistic linear logic with strong negation is also observed using such syntactical and semantical frameworks.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  3.  10
    Classical linear logics with mix separation principle.Norihiro Kamide - 2003 - Mathematical Logic Quarterly 49 (2):201-209.
    Variants of classical linear logics are presented based on the modal version of new structural rule !?mingle instead of the known rules !weakening and ?weakening. The cut-elimination theorems, the completeness theorems and a characteristic property named the mix separation principle are proved for these logics.
    Direct download  
     
    Export citation  
     
    Bookmark  
  4.  28
    Linear logic model of state revisited.V. de Paiva - 2014 - Logic Journal of the IGPL 22 (5):791-804.
    In an unpublished note Reddy introduced an extended intuitionistic linear calculus, called LLMS (for Linear Logic Model of State), to model state manipulation via the notions of sequential composition and ‘regenerative values’. His calculus introduces the connective ‘before’ ▹ and an associated modality †, for the storage of objects sequentially reusable. Earlier and independently de Paiva introduced a (collection of) dialectica categorical models for (classical and intuitionistic) Linear Logic, the categories Dial2Set. These categories contain, apart (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  5.  51
    Full intuitionistic linear logic.Martin Hyland & Valeria de Paiva - 1993 - Annals of Pure and Applied Logic 64 (3):273-291.
    In this paper we give a brief treatment of a theory of proofs for a system of Full Intuitionistic Linear Logic. This system is distinct from Classical Linear Logic, but unlike the standard Intuitionistic Linear Logic of Girard and Lafont includes the multiplicative disjunction par. This connective does have an entirely natural interpretation in a variety of categorical models of Intuitionistic Linear Logic. The main proof-theoretic problem arises from the observation of Schellinx (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  6.  23
    Linear logic in computer science.Thomas Ehrhard (ed.) - 2004 - New York: Cambridge University Press.
    Linear Logic is a branch of proof theory which provides refined tools for the study of the computational aspects of proofs. These tools include a duality-based categorical semantics, an intrinsic graphical representation of proofs, the introduction of well-behaved non-commutative logical connectives, and the concepts of polarity and focalisation. These various aspects are illustrated here through introductory tutorials as well as more specialised contributions, with a particular emphasis on applications to computer science: denotational semantics, lambda-calculus, logic programming and (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  7.  28
    Linear logic automata.Max I. Kanovich - 1996 - Annals of Pure and Applied Logic 78 (1-3):147-188.
    A Linear Logic automaton is a hybrid of a finite automaton and a non-deterministic Petri net. LL automata commands are represented by propositional Horn Linear Logic formulas. Computations performed by LL automata directly correspond to cut-free derivations in Linear Logic.A programming language of LL automata is developed in which typical sequential, non-deterministic and parallel programming constructs are expressed in the natural way.All non-deterministic computations, e.g. computations performed by programs built up of guarded commands in (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  8.  14
    The linear logic of multisets.A. Tzouvaras - 1998 - Logic Journal of the IGPL 6 (6):901-916.
    We consider finite multisets over some set of urelements equipped only with additive union [uplus ] and show that the {[otimes], -0}-Horn fragment of Intuitionistic Linear Logic has a sound and complete interpretation in them by interpreting [otimes] as [uplus ]. The linear implication is interpreted by ordered pairs of multisets expressing replacement. The operator ! is also defined in an asymptotic way. Soundness, completeness and partial completeness results are proved for the {×, -0, !}-Horn fragment as (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  9.  18
    Linear logic as a logic of computations.Max I. Kanovich - 1994 - Annals of Pure and Applied Logic 67 (1-3):183-212.
    The question at issue is to develop a computational interpretation of Linear Logic [8] and to establish exactly its expressive power. We follow the bottom-up approach. This involves starting with the simplest of the systems we are interested in, and then expanding them step-by-step. We begin with the !-Horn fragment of Linear Logic, which uses only positive literals, the linear implication ⊸, the tensor product ⊗, and the modal storage operator !. We give a complete (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  10.  21
    Lambda Calculus and Intuitionistic Linear Logic.Simona Ronchi Della Rocca & Luca Roversi - 1997 - Studia Logica 59 (3):417-448.
    The introduction of Linear Logic extends the Curry-Howard Isomorphism to intensional aspects of the typed functional programming. In particular, every formula of Linear Logic tells whether the term it is a type for, can be either erased/duplicated or not, during a computation. So, Linear Logic can be seen as a model of a computational environment with an explicit control about the management of resources.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  11.  33
    Linear logic with fixed resources.Dmitry A. Archangelsky & Mikhail A. Taitslin - 1994 - Annals of Pure and Applied Logic 67 (1-3):3-28.
    In this paper we continue the study of Girard's Linear Logic and introduce a new Linear Logic with modalities. Our logic describes not only the consumption, but also the presence of resources. We introduce a new semantics and a new calculus for this logic. In contrast to the results of Lincoln [7] and Kanovich [4] about the NP-completeness of the problem of the construction of a proof for a given sequent in the multiplicative fragment (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  12.  40
    Decision problems for propositional linear logic.Patrick Lincoln, John Mitchell, Andre Scedrov & Natarajan Shankar - 1992 - Annals of Pure and Applied Logic 56 (1-3):239-311.
    Linear logic, introduced by Girard, is a refinement of classical logic with a natural, intrinsic accounting of resources. This accounting is made possible by removing the ‘structural’ rules of contraction and weakening, adding a modal operator and adding finer versions of the propositional connectives. Linear logic has fundamental logical interest and applications to computer science, particularly to Petri nets, concurrency, storage allocation, garbage collection and the control structure of logic programs. In addition, there is (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   43 citations  
  13. Modelling Combinatorial Auctions in Linear Logic.Daniele Porello & Ulle Endriss - 2010 - In Daniele Porello & Ulle Endriss (eds.), Principles of Knowledge Representation and Reasoning: Proceedings of the Twelfth International Conference, {KR} 2010, Toronto, Ontario, Canada, May 9-13, 2010.
    We show that linear logic can serve as an expressive framework in which to model a rich variety of combinatorial auction mechanisms. Due to its resource-sensitive nature, linear logic can easily represent bids in combinatorial auctions in which goods may be sold in multiple units, and we show how it naturally generalises several bidding languages familiar from the literature. Moreover, the winner determination problem, i.e., the problem of computing an allocation of goods to bidders producing a (...)
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  14.  70
    Syllogisms in Rudimentary Linear Logic, Diagrammatically.Ruggero Pagnan - 2013 - Journal of Logic, Language and Information 22 (1):71-113.
    We present a reading of the traditional syllogistics in a fragment of the propositional intuitionistic multiplicative linear logic and prove that with respect to a diagrammatic logical calculus that we introduced in a previous paper, a syllogism is provable in such a fragment if and only if it is diagrammatically provable. We extend this result to syllogistics with complemented terms à la De Morgan, with respect to a suitable extension of the diagrammatic reasoning system for the traditional case (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  15. Linear Logic.Jean-Yves Girard - 1987 - Theoretical Computer Science 50:1–102.
    No categories
     
    Export citation  
     
    Bookmark   127 citations  
  16.  17
    Modeling linear logic with implicit functions.Sergey Slavnov - 2014 - Annals of Pure and Applied Logic 165 (1):357-370.
    Just as intuitionistic proofs can be modeled by functions, linear logic proofs, being symmetric in the inputs and outputs, can be modeled by relations . However generic relations do not establish any functional dependence between the arguments, and therefore it is questionable whether they can be thought as reasonable generalizations of functions. On the other hand, in some situations one can speak in some precise sense about an implicit functional dependence defined by a relation. It turns out that (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  17.  19
    Linear Logic and Lukasiewicz ℵ0- Valued Logic: A Logico-Algebraic Study.Jayanta Sen & M. K. Chakraborty - 2001 - Journal of Applied Non-Classical Logics 11 (3-4):313-329.
    A new characterization of all the MV-algebras embedded in a CL-algebra has been presented. A new sequent calculus for Lukasiewicz ℵ0-valued logic is introduced. Some links between this calculus and the sequent calculus for multiplicative additive linear logic are established. It has been shown that Lukasiewicz ℵ0-valued logic can be embedded in a suitable extension of MALL.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  18. Modelling Multilateral Negotiation in Linear Logic.Daniele Porello & Ulle Endriss - 2010 - In Daniele Porello & Ulle Endriss (eds.), {ECAI} 2010 - 19th European Conference on Artificial Intelligence, Lisbon, Portugal, August 16-20, 2010, Proceedings. pp. 381--386.
    We show how to embed a framework for multilateral negotiation, in which a group of agents implement a sequence of deals concerning the exchange of a number of resources, into linear logic. In this model, multisets of goods, allocations of resources, preferences of agents, and deals are all modelled as formulas of linear logic. Whether or not a proposed deal is rational, given the preferences of the agents concerned, reduces to a question of provability, as does (...)
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  19.  22
    Local computation in linear logic.Ugo Solitro & Silvio Valentini - 1993 - Mathematical Logic Quarterly 39 (1):201-212.
    This work deals with the exponential fragment of Girard's linear logic without the contraction rule, a logical system which has a natural relation with the direct logic . A new sequent calculus for this logic is presented in order to remove the weakening rule and recover its behavior via a special treatment of the propositional constants, so that the process of cut-elimination can be performed using only “local” reductions. Hence a typed calculus, which admits only local (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  20.  20
    Sequent Calculi for Intuitionistic Linear Logic with Strong Negation.Norihiro Kamide - 2002 - Logic Journal of the IGPL 10 (6):653-678.
    We introduce an extended intuitionistic linear logic with strong negation and modality. The logic presented is a modal extension of Wansing's extended linear logic with strong negation. First, we propose three types of cut-free sequent calculi for this new logic. The first one is named a subformula calculus, which yields the subformula property. The second one is termed a dual calculus, which has positive and negative sequents. The third one is called a triple-context calculus, (...)
    Direct download  
     
    Export citation  
     
    Bookmark   11 citations  
  21. Golog and Linear Logic Programming.G. White - 1998 - Dept. Of Computer Science, Queen Mary and Westfield College.
    Levesque et al. have defined a programming language, Golog, in order to reason about complex actions within the framework of the situation calculus. We build on previous work of ours and show how to translate Golog into linear logic, suitably augmented.
     
    Export citation  
     
    Bookmark  
  22.  11
    Linear logic for nets with bounded resources.Dmitry A. Archangelsky, Mikhail I. Dekhtyar & Mikhail A. Taitslin - 1996 - Annals of Pure and Applied Logic 78 (1-3):3-28.
    In this paper we introduce a new type of nets with bounded types of distributed resources . Linear Logic to describe the behaviour of BR-nets is defined. It is based on Girard's Linear Logic but captures not only consumption of resources but their presence as well. Theorem of soundness and completeness of the proposed axiomatization is proved and the complexity of the provability problem is established for the general case and some particular ones.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  23.  9
    Petri nets, Horn programs, Linear Logic and vector games.Max I. Kanovich - 1995 - Annals of Pure and Applied Logic 75 (1-2):107-135.
    Linear Logic was introduced by Girard as a resource-sensitive refinement of classical logic. In this paper we establish strong connections between natural fragments of Linear Logic and a number of basic concepts related to different branches of Computer Science such as Concurrency Theory, Theory of Computations, Horn Programming and Game Theory. In particular, such complete correlations allow us to introduce several new semantics for Linear Logic and to clarify many results on the complexity (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  24.  22
    Linear logic.Roberto Di Cosmo & Dale Miller - unknown - Stanford Encyclopedia of Philosophy.
    , from Stanford Encyclopaedia of Philosophy.
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  25.  3
    Lambda Calculus and Intuitionistic Linear Logic.Simona Della Rocca & Luca Roversi - 1997 - Studia Logica 59 (3):417-448.
    The introduction of Linear Logic extends the Curry-Howard Isomorphism to intensional aspects of the typed functional programming. In particular, every formula of Linear Logic tells whether the term it is a type for, can be either erased/duplicated or not, during a computation. So, Linear Logic can be seen as a model of a computational environment with an explicit control about the management of resources.This paper introduces a typed functional language Λ! and a categorical model (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  26.  49
    Lambda calculus and intuitionistic linear logic.Simona Ronchi della Rocca & Luca Roversi - 1997 - Studia Logica 59 (3):417-448.
    The introduction of Linear Logic extends the Curry-Howard Isomorphism to intensional aspects of the typed functional programming. In particular, every formula of Linear Logic tells whether the term it is a type for, can be either erased/duplicated or not, during a computation. So, Linear Logic can be seen as a model of a computational environment with an explicit control about the management of resources.This paper introduces a typed functional language ! and a categorical model (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  27.  36
    Linear logic displayed.Nuel Belnap - 1989 - Notre Dame Journal of Formal Logic 31 (1):14-25.
  28.  43
    A game semantics for linear logic.Andreas Blass - 1992 - Annals of Pure and Applied Logic 56 (1-3):183-220.
    We present a game semantics in the style of Lorenzen for Girard's linear logic . Lorenzen suggested that the meaning of a proposition should be specified by telling how to conduct a debate between a proponent P who asserts and an opponent O who denies . Thus propositions are interpreted as games, connectives as operations on games, and validity as existence of a winning strategy for P. We propose that the connectives of linear logic can be (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   56 citations  
  29.  55
    Linear logic proof games and optimization.Patrick D. Lincoln, John C. Mitchell & Andre Scedrov - 1996 - Bulletin of Symbolic Logic 2 (3):322-338.
    § 1. Introduction. Perhaps the most surprising recent development in complexity theory is the discovery that the class NP can be characterized using a form of randomized proof checker that only examines a constant number of bits of the “proof” that a string is in a language [6, 5, 31, 3, 4]. More specifically, writing ∣x∣ for the length of a string x, a language L in the class NP of languages recognizable in Nondeterministic polynomial time is traditionally given by (...)
    Direct download (11 more)  
     
    Export citation  
     
    Bookmark  
  30.  82
    The Semantics and Proof Theory of Linear Logic.Arnon Avron - 1988 - Theoretical Computer Science 57 (2):161-184.
    Linear logic is a new logic which was recently developed by Girard in order to provide a logical basis for the study of parallelism. It is described and investigated in Gi]. Girard's presentation of his logic is not so standard. In this paper we shall provide more standard proof systems and semantics. We shall also extend part of Girard's results by investigating the consequence relations associated with Linear Logic and by proving corresponding str ong (...)
    Direct download  
     
    Export citation  
     
    Bookmark   58 citations  
  31. Linear logic : A survey.J.-Y. Girard - 1995 - In Philippe De Groote (ed.), The Curry-Howard isomorphism. Louvain-la-Neuve: Academia.
     
    Export citation  
     
    Bookmark   7 citations  
  32.  84
    A new deconstructive logic: Linear logic.Vincent Danos, Jean-Baptiste Joinet & Harold Schellinx - 1997 - Journal of Symbolic Logic 62 (3):755-807.
    The main concern of this paper is the design of a noetherian and confluent normalization for LK 2. The method we present is powerful: since it allows us to recover as fragments formalisms as seemingly different as Girard's LC and Parigot's λμ, FD, delineates other viable systems as well, and gives means to extend the Krivine/Leivant paradigm of `programming-with-proofs' to classical logic ; it is painless: since we reduce strong normalization and confluence to the same properties for linear (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  33. Kripke models for linear logic.Gerard Allwein & J. Michael Dunn - 1993 - Journal of Symbolic Logic 58 (2):514-545.
    We present a Kripke model for Girard's Linear Logic (without exponentials) in a conservative fashion where the logical functors beyond the basic lattice operations may be added one by one without recourse to such things as negation. You can either have some logical functors or not as you choose. Commutatively and associatively are isolated in such a way that the base Kripke model is a model for noncommutative, nonassociative Linear Logic. We also extend the logic (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   29 citations  
  34. Linear logic: its syntax and semantics.Jean-Yves Girard - 1995 - In Jean-Yves Girard, Yves Lafont & Laurent Regnier (eds.), Advances in linear logic. New York, NY, USA: Cambridge University Press. pp. 222--1.
     
    Export citation  
     
    Bookmark   29 citations  
  35. 1 NATO Science Committee Fakultat fiir Informatik, Technische Universitgt Mijnchen.M. Wirsing, Jp Jouannoud, A. Scedrov & Bounded Linear Logic - 1993 - Annals of Pure and Applied Logic 60:89.
     
    Export citation  
     
    Bookmark  
  36.  30
    Linear Logic and Intuitionistic Logic.Mitsuhiro Okada - 2004 - Revue Internationale de Philosophie 4:449-481.
  37.  59
    Curry-Howard terms for linear logic.Frank A. Bäuerle, David Albrecht, John N. Crossley & John S. Jeavons - 1998 - Studia Logica 61 (2):223-235.
    In this paper we 1. provide a natural deduction system for full first-order linear logic, 2. introduce Curry-Howard-style terms for this version of linear logic, 3. extend the notion of substitution of Curry-Howard terms for term variables, 4. define the reduction rules for the Curry-Howard terms and 5. outline a proof of the strong normalization for the full system of linear logic using a development of Girard's candidates for reducibility, thereby providing an alternative to (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  38.  17
    Natural deduction for intuitionistic linear logic.A. S. Troelstra - 1995 - Annals of Pure and Applied Logic 73 (1):79-108.
    The paper deals with two versions of the fragment with unit, tensor, linear implication and storage operator of intuitionistic linear logic. The first version, ILL, appears in a paper by Benton, Bierman, Hyland and de Paiva; the second one, ILL+, is described in this paper. ILL has a contraction rule and an introduction rule !I for the exponential; in ILL+, instead of a contraction rule, multiple occurrences of labels for assumptions are permitted under certain conditions; moreover, there (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  39.  47
    Advances in linear logic.Jean-Yves Girard, Yves Lafont & Laurent Regnier (eds.) - 1995 - New York, NY, USA: Cambridge University Press.
    Linear logic, introduced in 1986 by J.-Y. Girard, is based upon a fine grain analysis of the main proof-theoretical notions of logic. The subject develops along the lines of denotational semantics, proof nets and the geometry of interaction. Its basic dynamical nature has attracted computer scientists, and various promising connections have been made in the areas of optimal program execution, interaction nets and knowledge representation. This book is the refereed proceedings of the first international meeting on (...) logic held at Cornell University, in June 1993. Survey papers devoted to specific areas of linear logic, as well as an extensive general introduction to the subject by J.-Y. Girard, have been added, so as to make this book a valuable tool both for the beginner and for the advanced researcher. (shrink)
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  40.  24
    Completeness results for linear logic on Petri nets.Uffe Engberg & Glynn Winskel - 1997 - Annals of Pure and Applied Logic 86 (2):101-135.
    Completeness is shown for several versions of Girard's linear logic with respect to Petri nets as the class of models. One logic considered is the -free fragment of intuitionistic linear logic without the exponential !. For this fragment Petri nets form a sound and complete model. The strongest logic considered is intuitionistic linear logic, with ,&, and the exponential ! , and forms of quantification. This logic is shown sound and complete (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  41.  38
    Temporalizing linear logic.Norihiro Kamide - 2007 - Bulletin of the Section of Logic 36 (3/4):173-182.
    Direct download  
     
    Export citation  
     
    Bookmark  
  42.  11
    Light linear logics with controlled weakening: Expressibility, confluent strong normalization.Max Kanovich - 2012 - Annals of Pure and Applied Logic 163 (7):854-874.
  43.  89
    Quantales and (noncommutative) linear logic.David N. Yetter - 1990 - Journal of Symbolic Logic 55 (1):41-64.
  44.  18
    On NP-completeness in Linear Logic.Alexey P. Kopylov - 1995 - Annals of Pure and Applied Logic 75 (1-2):137-152.
    In this paper the questions remaining open about NP-completeness of multiplicative and Horn fragments of the Linear Logic and the Linear Logic with the weakening rule are answered.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  45.  11
    REVIEWS-Linear logic in computer science.T. Ehrhard, J. Y. Girard, P. Ruet, P. Scott & Andrzej S. Murawski - 2006 - Bulletin of Symbolic Logic 12 (2):297-298.
  46. A modal view of linear logic.Simone Martini & Andrea Masini - 1994 - Journal of Symbolic Logic 59 (3):888-899.
    We present a sequent calculus for the modal logic S4, and building on some relevant features of this system we show how S4 can easily be translated into full propositional linear logic, extending the Grishin-Ono translation of classical logic into linear logic. The translation introduces linear modalities only in correspondence with S4 modalities. We discuss the complexity of the decision problem for several classes of linear formulas naturally arising from the proposed translations.
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  47. Linear Logic in Computer Science.P. Scott - 2006 - Bulletin of Symbolic Logic 12 (2):297-299.
  48.  29
    The finite model property for knotted extensions of propositional linear logic.C. J. van Alten - 2005 - Journal of Symbolic Logic 70 (1):84-98.
    The logics considered here are the propositional Linear Logic and propositional Intuitionistic Linear Logic extended by a knotted structural rule: γ, xn → y / γ, xm → y. It is proved that the class of algebraic models for such a logic has the finite embeddability property, meaning that every finite partial subalgebra of an algebra in the class can be embedded into a finite full algebra in the class. It follows that each such (...) has the finite model property with respect to its algebraic semantics and hence that the logic is decidable. (shrink)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  49.  29
    Extending intuitionistic linear logic with knotted structural rules.R. Hori, H. Ono & H. Schellinx - 1994 - Notre Dame Journal of Formal Logic 35 (2):219-242.
  50.  34
    Modalities in linear logic weaker than the exponential “of course”: Algebraic and relational semantics. [REVIEW]Anna Bucalo - 1994 - Journal of Logic, Language and Information 3 (3):211-232.
    We present a semantic study of a family of modal intuitionistic linear systems, providing various logics with both an algebraic semantics and a relational semantics, to obtain completeness results. We call modality a unary operator on formulas which satisfies only one rale (regularity), and we consider any subsetW of a list of axioms which defines the exponential of course of linear logic. We define an algebraic semantics by interpreting the modality as a unary operation on an IL-algebra. (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
1 — 50 / 1000