A linear algorithm for MLL proof net correctness and sequentialization

DOI10.1016/J.TCS.2010.12.021zbMATH Open1222.03067OpenAlexW2011228482MaRDI QIDQ534705FDOQ534705

Stefano Guerrini

Publication date: 10 May 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.12.021

zbMATH Keywords

proof netsmultiplicative linear logic

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Structure of proofs (03F07) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Cites Work

• Title not available (Why is that?)
• Efficiency of a Good But Not Linear Set Union Algorithm
• Linear logic
• A linear-time algorithm for a special case of disjoint set union
• An Efficient Unification Algorithm
• The structure of multiplicatives
• Correctness of Multiplicative (and Exponential) Proof Structures is NL-Complete
• A new correctness criterion for the proof nets of non-commutative multiplicative linear logics
• Fast verification of MLL proof nets via IMLL
• Parsing MELL proof nets

Cited In (7)

• A coding theoretic study of MLL proof nets
• Sequent reconstruction in LLM -- A sweepline proof
• Title not available (Why is that?)
• Proof nets for multiplicative cyclic linear logic and Lambek calculus
• Title not available (Why is that?)
• A formal model for a linear time correctness condition of proof nets of multiplicative linear logic
• Learning Lambek Grammars from Proof Frames

This page was built for publication: A linear algorithm for MLL proof net correctness and sequentialization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q534705)