A second order version of S2i and U21

DOI10.2307/2275071MaRDI QIDQ3985100zbMATH OpenOpenAlexFDO

Authors Gaisi Takeuti

Publication date 27 June 1992

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2275071

zbMATH Keywords

bounded arithmeticprovabilityseparation

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Second- and higher-order arithmetic and fragments (03F35)

Recommendations

• Separations of first and second order theories in bounded arithmetic
• scientific article; zbMATH DE number 218509
• scientific article; zbMATH DE number 1222931
• Bounded arithmetic and truth definition

Cited in

(11)

• Theories with self-application and computational complexity.
• Separations of first and second order theories in bounded arithmetic
• scientific article; zbMATH DE number 4160722 (Why is no real title available?)
• Recursion in second order bounded arithmetic.
• scientific article; zbMATH DE number 65757 (Why is no real title available?)
• scientific article; zbMATH DE number 176210 (Why is no real title available?)
• scientific article; zbMATH DE number 1222931 (Why is no real title available?)
• scientific article; zbMATH DE number 1302504 (Why is no real title available?)
• An unexpected separation result in Linearly Bounded Arithmetic
• Delineating classes of computational complexity via second order theories with weak set existence principles. I
• scientific article; zbMATH DE number 963569 (Why is no real title available?)

This page was built for publication: A second order version of S₂ⁱ and U₂¹

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