Soft linear logic and polynomial time (Q1827397): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2003.10.018 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2057183321 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4936120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of multiplicatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Light linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded linear logic: A modular approach to polynomial-time computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4842976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interaction combinators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945245 / rank
 
Normal rank

Latest revision as of 18:20, 6 June 2024

scientific article
Language Label Description Also known as
English
Soft linear logic and polynomial time
scientific article

    Statements

    Soft linear logic and polynomial time (English)
    0 references
    0 references
    6 August 2004
    0 references
    Linear logic
    0 references
    Second-order lambda-calculus
    0 references
    Polynomial time
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references