Abstract
We study the relationship between proof nets for mutiplicative linear logic (with unbounded fan-in logical connectives) and Boolean circuits. We give simulations of each other in the style of the proofs-as-programs correspondence; proof nets correspond to Boolean circuits and cut-elimination corresponds to evaluation. The depth of a proof net is defined to be the maximum logical depth of cut formulas in it, and it is shown that every unbounded fan-in Boolean circuit of depth n, possibly with stC0NN/sub 2/ gates, is polynomially simulated by a proof net of depth O(n) and vice versa. Here, stC0NN/sub 2/ stands for st-connectivity gates for undirected graphs of degree 2. Let APN/sup i/ be the class of languages for which there is a polynomial size, log/sup i/-depth family of proof nets. We then have APN/sup i/ = AC/sup i/(stCONN/sub 2/).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
