MLL normalization and transitive closure: circuits, complexity, and Euler tours Harry Mairson Problem: Given a proofnet in multiplicative linear - Transitive set - Document - PDFSEARCH.IO

First Page	Meta Content
	MLL normalization and transitive closure: circuits, complexity, and Euler tours Harry Mairson Problem: Given a proofnet in multiplicative linear Add to Reading List Document Date: 2008-03-28 12:21:03 Open Document File Size: 1,07 MB Share Result on Facebook Facility A B How complex / / OperatingSystem Sequent / / Person Harry Mairson / / Position interpreter / / ProgrammingLanguage ML / / SocialTag 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 linearAdd to Reading List