MLL normalization and transitive closure: circuits, complexity, and Euler tours Harry Mairson Problem: Given a proofnet in multiplicative linear

First Page		Document Content
Date: 2008-03-28 12:21:03 Logic Ordinal numbers Set theory Curry–Howard correspondence Dependently typed programming Type theory Ordinal arithmetic Mathematical logic Proof theory Mathematics		MLL normalization and transitive closure: circuits, complexity, and Euler tours Harry Mairson Problem: Given a proofnet in multiplicative linear Add to Reading List Source URL: www.cs.brandeis.edu Download Document from Source Website File Size: 1,07 MB Share Document on Facebook