Descriptive characterizations of computational complexity
Several complexity classes, such as Nlog-Space, P-Time, P-Space, and Exp- Time are characterized in terms of formulas of the form (\(\forall\) relations) (\(\exists\) objects) \(\phi\) with \(\phi\) quantifier-free. Different syntactic variants of such formulas characterize different complexity classes. In particular, such descriptive characterizations in terms of higher order logical formulas are considered.
scientific article; zbMATH DE number 4110109
scientific article