Révision 233 CSL17/main.tex
| main.tex (revision 233) | ||
|---|---|---|
| 30 | 30 |
|
| 31 | 31 |
\Copyright{Patrick Baillot and Anupam Das}%mandatory, please use full first names. LIPIcs license is "CC-BY"; http://creativecommons.org/licenses/by/3.0/
|
| 32 | 32 |
|
| 33 |
\subjclass{Dummy classification %-- please refer to \url{http://www.acm.org/about/class/ccs98-html}
|
|
| 33 |
\subjclass{F.4.1 Mathematical Logic %-- please refer to \url{http://www.acm.org/about/class/ccs98-html}
|
|
| 34 | 34 |
}% mandatory: Please choose ACM 1998 classifications from http://www.acm.org/about/class/ccs98-html . E.g., cite as "F.1.1 Models of Computation". |
| 35 |
\keywords{Dummy keyword -- please provide 1--5 keywords}% mandatory: Please provide 1-5 keywords
|
|
| 35 |
\keywords{Polynomial hierarchy,
|
|
| 36 |
Implicit complexity, |
|
| 37 |
Proof theory, |
|
| 38 |
Bounded arithmetic, |
|
| 39 |
Witness extraction, |
|
| 40 |
Ramification.}% mandatory: Please provide 1-5 keywords |
|
| 36 | 41 |
% Author macros::end %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% |
| 37 | 42 |
|
| 38 | 43 |
%Editor-only macros:: begin (do not touch as author)%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% |
| ... | ... | |
| 92 | 97 |
\newpage |
| 93 | 98 |
\appendix |
| 94 | 99 |
\input{appendix-arithmetic}
|
| 95 |
%\input{pv-theories}
|
|
| 96 |
\input{appendix-sequent-calculus}
|
|
| 97 |
\input{appendix-soundness}
|
|
| 98 |
\input{appendix-completeness}
|
|
| 100 |
%%\input{pv-theories}
|
|
| 101 |
%\input{appendix-sequent-calculus}
|
|
| 102 |
%\input{appendix-soundness}
|
|
| 103 |
%\input{appendix-completeness}
|
|
| 99 | 104 |
|
| 100 | 105 |
\end{document}
|
| 101 |
\grid |
|
| 106 |
|
|
Formats disponibles : Unified diff