Bootstrapping. I

DOI10.1016/J.APAL.2009.03.004MaRDI QIDQ636291zbMATH OpenOpenAlexFDO

Authors Sedki Boughattas, J.-P. Ressayre

Publication date 26 August 2011

Published in Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.apal.2009.03.004

zbMATH Keywords

complexity classesnonstandard modelscounterfeiting integersweak arithmetics

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of computation (including implicit computational complexity) (03D15) Nonstandard models of arithmetic (03H15)

Recommendations

• Bootstrap -- an exploration
• Bootstrapping the mode
• Bootstrapping I(1) data
• scientific article; zbMATH DE number 549941
• Proper bootstrapping
• scientific article; zbMATH DE number 708500

Cites work

• scientific article; zbMATH DE number 4059391 (Why is no real title available?)
• scientific article; zbMATH DE number 3659498 (Why is no real title available?)
• scientific article; zbMATH DE number 3702663 (Why is no real title available?)
• scientific article; zbMATH DE number 3784871 (Why is no real title available?)
• scientific article; zbMATH DE number 51556 (Why is no real title available?)
• scientific article; zbMATH DE number 2144527 (Why is no real title available?)
• scientific article; zbMATH DE number 227056 (Why is no real title available?)
• scientific article; zbMATH DE number 3214534 (Why is no real title available?)
• A model theoretic proof of a subexponential time witnessing theorem
• Arithmetization of the field of reals with exponentiation extended abstract
• L'Induction Ouverte Dans Les Anneaux Discrets Ordonnes et Normaux N'est pas Finiment Axiomatisable
• L'arithmétique ouverte et ses modèles non-standards
• Models with compactness properties relative to an admissible language
• Polynomial time uniformization and non-standard methods
• Rapidly growing Ramsey functions
• Set theory. An introduction to large cardinals
• Structure and definability in general bounded arithmetic theories
• Subsystems of true arithmetic and hierarchies of functions
• Subtle cardinals and linear orderings
• Trois theoremes sur l'induction pour les formules ouvertes munies de l'exponentielle
• Well-behaved principles alternative to bounded induction

Cited in

(10)

• On the finite axiomatizability of \(\forall\hat{\Sigma}^{\mathrm{b}}_1 (\hat{\mathsf{R}}^1_2)\)
• The strength of sharply bounded induction requires MSP
• Independence results for variants of sharply bounded induction
• Bootstrapping and content parts
• Bootstrap, or the art of pulling yourself out of a swamp
• Restricted polynomial induction versus ordinary induction
• Real closures of models of weak arithmetic
• Conservative fragments of \({{S}^{1}_{2}}\) and \({{R}^{1}_{2}}\)
• BOOTSTRAPPING THE LONG RUN
• Geoffrey Chew: Architect of the Bootstrap

This page was built for publication: Bootstrapping. I

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