scientific article; zbMATH DE number 3815629

MaRDI QIDQ3663285zbMATH OpenFDO

Authors Stasys Jukna

Publication date 1982

zbMATH Keywords

arithmetical complexitybounded quantifiersnondecreasing functionfirst-order formulasdensity arguments

Mathematics Subject Classification ID

Complexity of proofs (03F20) Complexity of computation (including implicit computational complexity) (03D15)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3663285)