A new correctness criterion for the proof nets of non-commutative multiplicative linear logics (Q4328819): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.2307/2694960 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2048460490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of multiplicatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof Nets for Lambek Calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Mathematics of Sentence Structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear logic / rank
 
Normal rank

Latest revision as of 23:19, 3 June 2024

scientific article; zbMATH DE number 1735279
Language Label Description Also known as
English
A new correctness criterion for the proof nets of non-commutative multiplicative linear logics
scientific article; zbMATH DE number 1735279

    Statements

    A new correctness criterion for the proof nets of non-commutative multiplicative linear logics (English)
    0 references
    0 references
    0 references
    8 October 2002
    0 references
    computational complexity
    0 references
    correctness criterion
    0 references
    marked Danos-Reginer graphs
    0 references
    Multiplicative Cyclic Linear Logic
    0 references
    non-commutative Linear Logic
    0 references
    algorithm for the correctness checking of proof nets
    0 references

    Identifiers