The strength of replacement in weak arithmetic

DOI10.1145/1183278.1183283zbMath1407.03075OpenAlexW2112512535MaRDI QIDQ5277762

Neil Thapen, Stephen A. Cook

Publication date: 12 July 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1183278.1183283

zbMATH Keywords

cryptographybounded arithmeticPV

Mathematics Subject Classification ID

Cryptography (94A60) First-order arithmetic and fragments (03F30) Complexity of proofs (03F20)

Related Items (7)

Quantified propositional calculus and a second-order theory for NC\(^{\text \textbf{1}}\) ⋮ Typical forcings, NP search problems and an extension of a theorem of Riis ⋮ The strength of extensionality. II: Weak weak set theories without infinity ⋮ Construction of models of bounded arithmetic by restricted reduced powers ⋮ Consequences of the provability of NP ⊆ P/poly ⋮ Examining Fragments of the Quantified Propositional Calculus ⋮ Unnamed Item

This page was built for publication: The strength of replacement in weak arithmetic