On phase semantics and denotational semantics: The exponentials (Q5939845)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1623318
Language Label Description Also known as
default for all languages
No label defined
    English
    On phase semantics and denotational semantics: The exponentials
    scientific article; zbMATH DE number 1623318

      Statements

      On phase semantics and denotational semantics: The exponentials (English)
      0 references
      0 references
      0 references
      3 February 2003
      0 references
      propositional linear logic
      0 references
      denotational semantics
      0 references
      phase semantics
      0 references
      coherence spaces
      0 references
      sequent calculus
      0 references
      indexd linear logic
      0 references
      An indexed version of propositional linear logic with exponentials is defined together with a sequent calculus for this system. To a formula \(A\) of indexed linear logic are associated: an underlying formula \(\underline{A}\) of linear logic, an interpretation \(|\underline{A}|\) of this formula in the category of sets and relations, and a family \(\langle A\rangle\) of elements of \(A\). Then \(A\) is provable in indexed linear logic iff the family \(\langle A\rangle\) is contained in the interpretation of some proof of \(\underline{A}\). To this setting the product phase semantics of indexed multiplicative additive linear logic (by the same authors) is extended (symmetric product phase spaces are defined). A soundness result is proved and it is shown how a denotational model of linear logic can be associated to any symmetric product phase space. On this basis a new coherence space model of linear logic is obtained. NEWLINENEWLINENEWLINESome details to give an idea how indexed linear logic \(\text{LL}(I)\) is defined. NEWLINENEWLINENEWLINELet \(I\) be an infinite denumerable set. NEWLINENEWLINENEWLINELet \(J, K\) be two sets. A function \(u:J\rightarrow K\) is almost injective if, for any \(k\in K\), the set \(u^{-1}(k)\) is finite. NEWLINENEWLINENEWLINEEvery formula \(A\) has a domain \(d(A)\subseteq I\). (\dots) NEWLINENEWLINENEWLINEIf \(A, B\) are formulae of a domain \(J\subseteq I\) then \(A\otimes B\) is a formula of the domain \(J\). (Similarly for \(par\).) NEWLINENEWLINENEWLINEIf \(A\) is a formula of a domain \(J\) and \(B\) is a formula of a domain \(K\), \(J\cap K=\emptyset\), then \(A\oplus B, A\& B\) are formulae of the domain \(J+K\) (the disjoint union of \(J\) and \(K\)). NEWLINENEWLINENEWLINEIf \(A\) is a formula of a domain \(J\) and \(u:J\rightarrow K\) is an almost injective function then \(!_uA\) and \(?_uA\) are formulae of the domain \(K\) (\dots)NEWLINENEWLINENEWLINEFor \(\text{LL}(I)\) a succedent-only sequent calculus is considered.
      0 references

      Identifiers