Abstract.
Having defined a notion of homology for paired graphs, Métayer ([Ma]) proves a homological correctness criterion for proof nets, and states that for any proof net \(G\) there exists a Jordan-Hölder decomposition of \({\mathsf H}_0(G)\). This decomposition is determined by a certain enumeration of the pairs in \(G\). We correct his proof of this fact and show that there exists a 1-1 correspondence between these Jordan-Hölder decompositions of \({\mathsf H}_0(G)\) and the possible ‘construction-orders’ of the par-net underlying \(G\).
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received November 7, 1996
Rights and permissions
About this article
Cite this article
Puite, Q., Schellinx, H. On the Jordan-Hölder decomposition of proof nets. Arch Math Logic 37, 59–65 (1997). https://doi.org/10.1007/s001530050083
Issue Date:
DOI: https://doi.org/10.1007/s001530050083