The
workshop is dedicated to the characterization, analysis, comparison, development, and
implementation of computational complexity issues within the following areas and
approaches.
- Descriptive
complexity (finite model theory)
- Proof
theory
(e.g. bounded arithmetic, other weak theories, weak higher order logics, linear logic)
- Applicative
formalisms
(e.g. function algebras, ramified recurrence, control mechanisms in lambda calculi)
|
