scientific article; zbMATH DE number 218517
[For the entire collection see Zbl 0758.00018.] Linear logic is created by \textit{J. Y. Girard} [Theor. Comput. Sci. 50, 1- 102 (1987; Zbl 0625.03037)] as constructive logic useful in computer science. New connectives are introduced, the rules of weakening and of contraction are abandoned or in some sense replaced by the one-place connectives ? and !. Girard [loc. cit.] handles the classical case, \textit{J. Y. Girard} and \textit{Y. Lafont} [Lect. Notes Comput. Sci. 250, 52-66 (1987; Zbl 0647.03016)] introduce the intuitionistic version of linear logic. The paper under review is especially devoted to the semantics of intuitionistic linear logic. It is confined to propositional logic. In the beginning the language, axioms and rules are presented of the following three sequent calculi: IL contains the one-place connectives \(\neg\), 1, \(\top\), !, ? and the binary connectives \(\otimes\), \(\&\), \(\oplus\), \(\multimap\). In *IL, ! and ? are dropped. ILO is IL, where ? is replaced by the propositional constant 0. Cut elimination is only mentioned. For the semantics intuitionistic \(*\)- linear, 0-intuitionistic \(*\)-linear, intuitionistic linear and 0- intuitionistic structures are introduced. Canonical versions of such structures are obtained from the power sets of commutative monoids by suitably defining the operations \(\multimap\) and \(\otimes\), by which the connectives \(\multimap\) and \(\otimes\) are interpreted. For \(\&\) and \(\oplus\) the set theoretical operations of intersection and union are available. Structures of this kind are called simple. Closure operations lead from these structures again to such structures, so-called intuitionistic phase spaces. By distinguishing two special subsets of the power set of the underlying monoid, intuitionistic topophase spaces are characterized. Soundness and completeness of IL, *IL and ILO with respect to intuitionistic topophase spaces, intuitionistic phase spaces, respectively 0-intuitionistic topophase spaces are proven. If the concept of model is confined to simple topophase respectively phase spaces, i.e. if the models are omitted which are obtained by applying closure operations, then a counter example shows that completeness fails. The paper contains detailed definitions. Motivations and connections are treated a bit too short.
- The semantics and proof theory of linear logic
- Language in action
- Nonmodal classical linear predicate logic is a fragment of intuitionistic linear logic
- Phase semantics for a pure noncommutative linear propositional logic
- A uniform semantic proof for cut-elimination and completeness of various first and higher order logics.
- Sequent calculi for choice logics
- From input/output logics to conditional logics via sequents -- with provers
- Specialization of antecedent negation loop-rule for a fragment of propositional intuitionistic logic sequent calculus
- Intuitionistic sequent-style calculus with explicit structural rules
- From Display Calculi to Deep Nested Sequent Calculi: Formalised for Full Intuitionistic Linear Logic
- A Focused Sequent Calculus for Higher-Order Logic
- THE JUDGEMENT CALCULUS FOR INTUITIONISTIC LINEAR LOGIC: PROOF THEORY AND SEMANTICS
- A simplified semantics for a fragment of intuitionistic linear logic
- scientific article; zbMATH DE number 4108721 (Why is no real title available?)
- CLDS for propositional intuitionistic logic
- scientific article; zbMATH DE number 1004877 (Why is no real title available?)
- Pretopology semantics for bimodal intuitionistic linear logic
- Sequent systems for compact bilinear logic
- Sequent Calculi for Intuitionistic Linear Logic with Strong Negation
- Finite sequent calculi for PLTL
- Sequent Calculus for Intuitionistic Epistemic Logic IEL
- Intuitionistic phase semantics is almost classical
- A Constraint Sequent Calculus for First-Order Logic with Linear Integer Arithmetic
- A Gentzen-type calculus of sequents for single-operator propositional logic
- A comparison between lambek syntactic calculus and intuitionistic linear propositional logic
- A sequent calculus for first-order logic formalized in Isabelle/HOL
- A sequent calculus for a negative free logic
- An algebraic investigation of linear logic
- Simple consequence relations
- A coding method for a sequent calculus of propositional logic
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4694232)