scientific article; zbMATH DE number 3979054

MaRDI QIDQ3744158zbMATH OpenFDO

Authors

Publication date 1985

zbMATH Keywords

adequacy of Peano arithmetic for computer sciencearithmetic quantifier structure of computational problemsindependence results

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Second- and higher-order arithmetic and fragments (03F35) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 4193657
• scientific article; zbMATH DE number 440481
• Incompleteness in the finite domain
• scientific article; zbMATH DE number 1285799
• Weak arithmetics

Cited in

(10)

• Index sets and presentations of complexity classes
• scientific article; zbMATH DE number 440481 (Why is no real title available?)
• scientific article; zbMATH DE number 1285799 (Why is no real title available?)
• scientific article; zbMATH DE number 1533816 (Why is no real title available?)
• scientific article; zbMATH DE number 4193657 (Why is no real title available?)
• The strength of replacement in weak arithmetic
• Weak arithmetics
• On end extensions of models of subsystems of Peano arithmetic
• Weak arithmetic
• Recognition complexity of theories and their computational expressivity

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 Q3744158)