Extensions of models of PV

MaRDI QIDQ4381413zbMATH OpenFDO

Authors Jan Krajíček

Publication date 19 October 1998

zbMATH Keywords

elementary extensionmodels of PV

Mathematics Subject Classification ID

Models of arithmetic and set theory (03C62) Complexity of computation (including implicit computational complexity) (03D15) First-order arithmetic and fragments (03F30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Binary models generated by their tally part
• Consequences of the provability of NP ⊆ P/poly
• scientific article; zbMATH DE number 999649

Cited in

(9)

• Binary models generated by their tally part
• Feasibly constructive proofs of succinct weak circuit lower bounds
• Polynomial time ultrapowers and the consistency of circuit lower bounds
• PVS\#: streamlined tacticals for PVS
• Work for the workers: Advances in engineering mechanics and instruction in France, 1800–1830
• Circuit lower bounds in bounded arithmetics
• Hardness magnification near state-of-the-art lower bounds
• A remark on pseudo proof systems and hard instances of the satisfiability problem
• Eberlein decomposition for PV inflation systems

This page was built for publication: Extensions of models of PV

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