Techniques in weak analysis for conservation results

zbMATH Open1432.03125MaRDI QIDQ5222079FDOQ5222079

Authors: António Marques Fernandes, Fernando Ferreira, Gilda Ferreira 

Publication date: 30 March 2020

Recommendations

• scientific article; zbMATH DE number 2110622
• scientific article; zbMATH DE number 2236625
• Delineating classes of computational complexity via second order theories with weak set existence principles. I
• A feasible theory for analysis
• Weak arithmetics

zbMATH Keywords

bounded arithmeticforcingcut-eliminationconservation resultsweak analysispolytime computability

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Complexity of computation (including implicit computational complexity) (03D15) Second- and higher-order arithmetic and fragments (03F35) Model-theoretic forcing (03C25)

Cited In (2)

• Preservation of weak SAI's under increasing transformations with applications
• Some conservation results on weak König's lemma

This page was built for publication: Techniques in weak analysis for conservation results

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