A formal model for a linear time correctness condition of proof nets of multiplicative linear logic (Q2119124): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Semi-persistent Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of multiplicatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for a special case of disjoint set union / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for MLL proof net correctness and sequentialization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Unification Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Direct encodings of NP-complete problems into Horn sequents of multiplicative linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast verification of MLL proof nets via IMLL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correctness of linear logic proof structures is NL-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4140378 / rank
 
Normal rank

Latest revision as of 10:18, 28 July 2024

scientific article
Language Label Description Also known as
English
A formal model for a linear time correctness condition of proof nets of multiplicative linear logic
scientific article

    Statements

    Identifiers