Title of article
A sorting network in bounded arithmetic
Author/Authors
Je??bek، نويسنده , , Emil، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2011
Pages
15
From page
341
To page
355
Abstract
We formalize the construction of Paterson’s variant of the Ajtai–Komlós–Szemerédi sorting network of logarithmic depth in the bounded arithmetical theory VNC ∗ 1 (an extension of VNC 1 ), under the assumption of the existence of suitable expander graphs. We derive a conditional p-simulation of the propositional sequent calculus in the monotone sequent calculus MLK .
Keywords
bounded arithmetic , Sorting network , proof complexity , Monotone sequent calculus
Journal title
Annals of Pure and Applied Logic
Serial Year
2011
Journal title
Annals of Pure and Applied Logic
Record number
1444538
Link To Document