A constructive game semantics for the language of linear logic (Q1361252): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(4 intermediate revisions by 3 users not shown)
Property / reviewed by
 
Property / reviewed by: Grigori Mints / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Grigori Mints / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Games and full completeness for multiplicative linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A game semantics for linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5812175 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dialogspiele als Semantische Grundlage von Logikkalkülen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5726697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3893889 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4215635 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 17:39, 27 May 2024

scientific article
Language Label Description Also known as
English
A constructive game semantics for the language of linear logic
scientific article

    Statements

    A constructive game semantics for the language of linear logic (English)
    0 references
    0 references
    4 February 1998
    0 references
    A system ET of first-order additive-multiplicative logic is introduced via game semantics and proved decidable. ET contains linear logic and is contained in BCK (linear logic plus weakening). The author notes similarity to a game semantics \(G\) introduced by \textit{A. Blass} [Ann. Pure Appl. Logic 56, 183-220 (1992; Zbl 0763.03008)] and conjectures that the method of the paper under review can be adapted to show the decidability of formulas valid in \(G\).
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    first-order additive-multiplicative logic
    0 references
    game semantics
    0 references
    linear logic
    0 references
    BCK
    0 references
    decidability
    0 references
    0 references