Well-behaved principles alternative to bounded induction

DOI10.1016/j.tcs.2004.03.022zbMath1087.03036OpenAlexW1993137092MaRDI QIDQ1885028

Zofia Adamowicz, Leszek Aleksander Kołodziejczyk

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.03.022

zbMATH Keywords

Bounded arithmeticSkolemBounded inductionEvaluations

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30)

Related Items (4)

Restricted polynomial induction versus parameter free ordinary induction ⋮ Restricted polynomial induction versus ordinary induction ⋮ The strength of sharply bounded induction requires MSP ⋮ Bootstrapping. I

Cites Work

• Unnamed Item
• A contribution to the end-extension problem and the \(\Pi_ 1\) conservativeness problem
• Structure and definability in general bounded arithmetic theories
• On complexity reduction of \(\Sigma_1\) formulas
• Dynamic ordinal analysis
• Herbrand consistency and bounded arithmetic
• On Herbrand consistency in weak arithmetic

This page was built for publication: Well-behaved principles alternative to bounded induction