A Note on Induction Schemas in Bounded Arithmetic
Aleksandar Ignjatovic
Abstract
As is well known, Buss' theory of bounded arithmetic S12 proves Σ0b(Σ1b)-LIND; however, we show that Allen's D21 does not prove Σ0b(Σ1b)-LLIND unless P = NC. We also give some interesting alternative axiomatisations of S12.
Create a lesson
Related papers
String Diagrams for Process Mining
Antony R. Lee, Peter Tiňo, Iain B. Styles
Rich Sequences and Decidability of Arithmetic Theories
Toghrul Karimov, Joris Nieuwveld, Joël Ouaknine
An Explicit Ordinal Bound for System T Dialogue Trees
MingKun Xiao, YiXuan Sun
Concurrency, Causality and Conflict via Independence in Reversible Calculi
Clément Aubert, Gabriele Cecilia, Iain C. C. Phillips et al.
A Theory of a Two-Dimensional Typed Lambda Calculus
Daniel O. Martínez-Rivillas, Arthur F. Ramos, Ruy J. G. B. de Queiroz
FloatLib: Verified Floating-Point Arithmetic in Lean
Robert Joseph George, Will Adkisson, Anima Anandkumar