Intuitionistic Multiplicative Proof Nets as Models of Directed Acyclic Graph Descriptions - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2001

Intuitionistic Multiplicative Proof Nets as Models of Directed Acyclic Graph Descriptions

Abstract

Given an intuitionistic proof net of linear logic, we abstract an order between its atomic formulas. From this order, we represent intuitionistic multiplicative proof nets in the more compact form of models of directed acyclic graph descriptions. If we restrict the logical framework to the implicative fragment of intuitionistic linear logic, we show that proof nets reduce to models of tree descriptions.

Domains

Other [cs.OH]
Not file

Dates and versions

inria-00100667 , version 1 (26-09-2006)

Identifiers

  • HAL Id : inria-00100667 , version 1

Cite

Guy Perrier. Intuitionistic Multiplicative Proof Nets as Models of Directed Acyclic Graph Descriptions. 8th International Conference on Logic for Programming, Artificial Intelligence and Reasoning - LPAR 2001, 2001, Havana, Cuba, France. pp.233-248. ⟨inria-00100667⟩
87 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More