The strength of replacement in weak arithmetic
From MaRDI portal
Publication:5277762
DOI10.1145/1183278.1183283zbMath1407.03075MaRDI QIDQ5277762
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
Related Items
Unnamed Item, Consequences of the provability of NP ⊆ P/poly, Construction of models of bounded arithmetic by restricted reduced powers, The strength of extensionality. II: Weak weak set theories without infinity, 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, Examining Fragments of the Quantified Propositional Calculus