| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4662296 | Annals of Pure and Applied Logic | 2009 | 11 Pages |
Abstract
Any arbitrarily complicated non-oriented graph, that is a graph of arbitrarily large genus, can be encoded in a cut-free proof. This unpublished result of Statman was shown in the early seventies. We provide a proof of it, and of a number of other related facts.
Related Topics
Physical Sciences and Engineering
Mathematics
Logic
