Light linear logics
From LLWiki
(Difference between revisions)
(New page: Light linear logics are variants of linear logic characterizing complexity classes. They are designed by defining alternative exponential connectives, which induce a complexity bound on th...) |
|||
| Line 1: | Line 1: | ||
Light linear logics are variants of linear logic characterizing complexity classes. They are designed by defining alternative exponential connectives, which induce a complexity bound on the cut-elimination procedure. |
Light linear logics are variants of linear logic characterizing complexity classes. They are designed by defining alternative exponential connectives, which induce a complexity bound on the cut-elimination procedure. |
||
| − | + | Light linear logics are one of the approaches used in implicit computational complexity, the research area studying the computational complexity of programs without referring to external measuring conditions or particular machine models. |
|
| − | Light linear logics are one of the approaches used in \textit{implicit computational complexity}, the research area studying the computational complexity of programs without referring to external measuring conditions or particular machine models. |
||
\section{Elementary linear logic} |
\section{Elementary linear logic} |
||
Revision as of 18:13, 19 March 2009
Light linear logics are variants of linear logic characterizing complexity classes. They are designed by defining alternative exponential connectives, which induce a complexity bound on the cut-elimination procedure. Light linear logics are one of the approaches used in implicit computational complexity, the research area studying the computational complexity of programs without referring to external measuring conditions or particular machine models.
\section{Elementary linear logic} \section{Light linear logic}
