scientific article

zbMath0699.03032MaRDI QIDQ3476809

Samuel R. Buss

Publication date: 1990

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

replacementconservationaxiomatizationfragments of Bounded Arithmetic

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30)

Related Items (15)

On induction-free provability ⋮ Circuit principles and weak pigeonhole variants ⋮ Relating the bounded arithmetic and polynomial time hierarchies ⋮ Quantified propositional calculus and a second-order theory for NC\(^{\text \textbf{1}}\) ⋮ Preservation theorems and restricted consistency statements in bounded arithmetic ⋮ Collapsing modular counting in bounded arithmetic and constant depth propositional proofs ⋮ On parallel hierarchies and R ki ⋮ A second-order system for polytime reasoning based on Grädel's theorem. ⋮ Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem ⋮ Theories with self-application and computational complexity. ⋮ On truth-table reducibility to SAT ⋮ Arithmetizing uniform \(NC\) ⋮ A new proof of the weak pigeonhole principle ⋮ \(S^ i_ 3\) and \(\overset\circ V^ i_ 2(BD)\) ⋮ Ordinal notations and well-orderings in bounded arithmetic

This page was built for publication: