scientific article; zbMATH DE number 4160722

MaRDI QIDQ3487339zbMATH OpenFDO

Authors Gaisi Takeuti

Publication date 1990

zbMATH Keywords

provabilityBounded Arithmetic

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30)

Recommendations

• scientific article; zbMATH DE number 218509
• Bounded arithmetic and the polynomial hierarchy
• Bounded arithmetic and truth definition
• A Remark on Independence Results for Sharply Bounded Arithmetic
• A second order version of S₂ⁱ and U₂¹

Cited in

(11)

• Notations for exponentiation.
• The strength of sharply bounded induction requires MSP
• On sharply bounded length induction
• Bounded arithmetic for NC, ALogTIME, L and NL
• Multifunction algebras and the provability of PH
• Strict \({\varPi^1_1}\)-reflection in bounded arithmetic
• The critical number of a variable in a function
• Relating the bounded arithmetic and polynomial time hierarchies
• Determinacy and the sharp function on the reals
• Independence results for variants of sharply bounded induction
• Separations of first and second order theories in bounded arithmetic

This page was built for publication:

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