Induction rules in bounded arithmetic
The article is well organized and written. Two main results are presented, a conservation result, and a characterization of parameter-free induction axioms and rules involving an axiomatic extension of \(G_i\) proof system. The author purpose the study of a parameter-free version of Samuel Buss's theories proving that, for theories \(T\) of appropriate complexity, \(T + T^i_2 (T + S^i_2)\) is conservative over \(T + \hat\Sigma^b_i-(P)\mathrm{IND}^R \) and \( T + \hat\Pi^b_i-(P)\mathrm{IND}^R\) w.r.t. suitable classes of formulas, implying certain conservativity of \(T^i_2 (S^i_2)\) over \(\hat\Sigma^b_i-(P)\mathrm{IND}^-\) and \(\hat\Pi^b_i-(P)\mathrm{IND}^-\). Besides, considering the connection between bounded arithmetic and propositional proof system, the author present a characterization of parameter-free induction axioms and induction rules involving a \(G_i + \xi\) proof system, that is, using variants of reflection principles for fragments of quantified propositional calculi \(G_i\). Finally, some typos, on page 475, Observation 5.2, page 484, Theorem 5.20, and page 485, Corollary 5.23, the symbol \(\square\) does not correspond to the end of the paragraph.
- An Application of Boolean Complexity to Separation Problems in Bounded Arithmetic
- Approximate counting by hashing in bounded arithmetic
- Bounded arithmetic and the polynomial hierarchy
- Collapsing modular counting in bounded arithmetic and constant depth propositional proofs
- Consequences of the provability of NP ⊆ P/poly
- Diophantine induction
- Existentially Closed Models and Conservation Results in Bounded Arithmetic
- Fragments of Bounded Arithmetic and Bounded Query Classes
- Functions provably total in $I^{-}Σ_{n}$
- scientific article; zbMATH DE number 3912375 (Why is no real title available?)
- scientific article; zbMATH DE number 4039892 (Why is no real title available?)
- scientific article; zbMATH DE number 4075030 (Why is no real title available?)
- scientific article; zbMATH DE number 3557241 (Why is no real title available?)
- scientific article; zbMATH DE number 806747 (Why is no real title available?)
- scientific article; zbMATH DE number 819737 (Why is no real title available?)
- scientific article; zbMATH DE number 1420845 (Why is no real title available?)
- scientific article; zbMATH DE number 227056 (Why is no real title available?)
- Induction rules, reflection principles, and provably recursive functions
- Lifting independence results in bounded arithmetic
- Local induction and provably total computable functions
- Logical foundations of proof complexity
- Notes on polynomially bounded arithmetic
- On parameter free induction schemas
- On theories of bounded arithmetic for \(\mathrm{NC}^1\)
- On Σ1‐definable Functions Provably Total in I ∏
- Parameter free induction and provably total computable functions
- Quantified propositional calculi and fragments of bounded arithmetic
- Relating the bounded arithmetic and polynomial time hierarchies
- Simulating non-prenex cuts in quantified propositional calculus
- The Boolean Hierarchy and the Polynomial Hierarchy: A Closer Connection
- The provably total search problems of bounded arithmetic
- Witnessing functions in bounded arithmetic and search problems
- Well-behaved principles alternative to bounded induction
- Unprovability results for clause set cycles
- Induction and Skolemization in saturation theorem proving
- Finite multiplicity theorems for induction and restriction
- scientific article; zbMATH DE number 3880682 (Why is no real title available?)
- scientific article; zbMATH DE number 3948262 (Why is no real title available?)
- Induction the Hard Way
- Universal Induction and True Universal Arithmetic
- Restricted polynomial induction versus ordinary induction
- An induction principle for consequence in arithmetic universes
- Restricted polynomial induction versus parameter free ordinary induction
- scientific article; zbMATH DE number 5058824 (Why is no real title available?)
- Fragments of arithmetic and cyclic proofs
This page was built for publication: Induction rules in bounded arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2309507)