Expressing versus Proving: Relating Forms of Complexity in Logic

DOI10.1093/logcom/exq008zbMath1256.03045OpenAlexW2029183607MaRDI QIDQ2882560

Antonina Kolokolova

Publication date: 7 May 2012

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exq008

zbMATH Keywords

survey paperbounded arithmeticproof complexitydescriptive complexitycomplexity in logic

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) First-order arithmetic and fragments (03F30) Model theory of finite structures (03C13) Complexity of proofs (03F20)

This page was built for publication: Expressing versus Proving: Relating Forms of Complexity in Logic