On induction-free provability
From MaRDI portal
In this article we study relations between various fragments of bounded arithmetic. The fragments of interest here are the theories \(S^i_2\) and \(T^i_2\) introduced by Buss.
Cites work
- Bounded arithmetic and the polynomial hierarchy
- Bounded arithmetic and truth definition
- Exponentiation and second-order bounded arithmetic
- scientific article; zbMATH DE number 4145897 (Why is no real title available?)
- scientific article; zbMATH DE number 3784875 (Why is no real title available?)
- On the scheme of induction for bounded arithmetic formulas
- Quantified propositional calculi and fragments of bounded arithmetic
Cited in
(15)- On the proof-theoretic strength of monotone induction in explicit mathematics
- Parameter free induction and provably total computable functions
- Simulating non-prenex cuts in quantified propositional calculus
- scientific article; zbMATH DE number 440485 (Why is no real title available?)
- Examining Fragments of the Quantified Propositional Calculus
- On parameter free induction schemas
- On A Problem Concerning Parameter Free Induction
- Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic
- scientific article; zbMATH DE number 1088194 (Why is no real title available?)
- Restricted polynomial induction versus ordinary induction
- Restricted polynomial induction versus parameter free ordinary induction
- Fragments of bounded arithmetic and the lengths of proofs
- Preservation theorems and restricted consistency statements in bounded arithmetic
- Lemmaless induction in trace logic
- Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem
This page was built for publication: On induction-free provability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1353982)
