scientific article
From MaRDI portal
Publication:3744158
zbMath0606.03016MaRDI QIDQ3744158
No author found.
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
independence resultsadequacy of Peano arithmetic for computer sciencearithmetic quantifier structure of computational problems
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Second- and higher-order arithmetic and fragments (03F35)
Related Items (2)
Index sets and presentations of complexity classes ⋮ On end extensions of models of subsystems of Peano arithmetic
This page was built for publication:
