Linear logic by levels and bounded time complexity (Q1044841): 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.2009.09.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2091581695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intuitionistic Light Affine Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification of Ptime Reducibility for system F Terms: Type Inference in Dual Light Affine Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stratified coherence spaces: A denotational semantics for light linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new recursion-theoretic characterization of the polytime functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing optimal reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5565113 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear logic and elementary time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4842980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5815602 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logical account of pspace / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Soft Type Assignment System for λ-Calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4896506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Light linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3548540 / 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: PREDICATE AND SET-THEORETIC CALCULI BASED ON LOGIC WITHOUT CONTRACTIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of (linear) exponentials based on extended sequents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Soft linear logic and polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A foundational delineation of poly-time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850553 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3142166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Predicative Analysis of Feasibility and Diagonalization / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-sequent calculus: A proof theory of modalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear logic and polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an interpretation of safe recursion in light affine logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Light affine set theory: A naive set theory of polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additives of linear logic and normalization. I: A (restricted) Church-Rosser property. / rank
 
Normal rank

Latest revision as of 06:48, 2 July 2024

scientific article
Language Label Description Also known as
English
Linear logic by levels and bounded time complexity
scientific article

    Statements

    Linear logic by levels and bounded time complexity (English)
    0 references
    0 references
    0 references
    15 December 2009
    0 references
    implicit computational complexity
    0 references
    light linear logics
    0 references
    type systems for polynomial time
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers