Sequent reconstruction in LLM -- A sweepline proof

DOI10.1016/0168-0072(94)00033-YzbMath0830.03027OpenAlexW2033995205MaRDI QIDQ1892938

Richard Banach

Publication date: 26 July 1995

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(94)00033-y

zbMATH Keywords

linear logiccomputational geometrygraph structuressequentproof-netssequentialization theoremstandard layoutsweepline algorithms

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Proof theory in general (including proof-theoretic semantics) (03F03) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items (5)

Unnamed Item ⋮ Proof nets sequentialisation in multiplicative linear logic ⋮ Parsing MELL proof nets ⋮ Connection methods in linear logic and proof nets construction ⋮ Proof nets, garbage, and computations

Cites Work

• Linear logic
• A sweepline algorithm for Voronoi diagrams
• Planar and braided proof-nets for multiplicative linear logic with mix
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Sequent reconstruction in LLM -- A sweepline proof