On induction-free provability

DOI10.1007/BF01531024zbMath0865.03045MaRDI QIDQ1353982

Jan Krajíček, Gaisi Takeuti

Publication date: 13 May 1997

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

fragments of bounded arithmetic

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30)

Related Items (8)

Restricted polynomial induction versus parameter free ordinary induction ⋮ Restricted polynomial induction versus ordinary induction ⋮ Preservation theorems and restricted consistency statements in bounded arithmetic ⋮ Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem ⋮ Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic ⋮ Examining Fragments of the Quantified Propositional Calculus ⋮ Simulating non-prenex cuts in quantified propositional calculus ⋮ Fragments of bounded arithmetic and the lengths of proofs

Cites Work

• Unnamed Item
• Unnamed Item
• Exponentiation and second-order bounded arithmetic
• On the scheme of induction for bounded arithmetic formulas
• Bounded arithmetic and truth definition
• Bounded arithmetic and the polynomial hierarchy
• Quantified propositional calculi and fragments of bounded arithmetic

This page was built for publication: On induction-free provability