scientific article; zbMATH DE number 4145897

zbMATH Open0699.03032MaRDI QIDQ3476809FDOQ3476809

Samuel R. Buss

Publication date: 1990

Title of this publication is not available (Why is that?)

Recommendations

• A Note on Conservativity Relations among Bounded Arithmetic Theories
• On the Herbrand notion of consistency for finitely axiomatizable fragments of bounded arithmetic theories
• Herbrand consistency of some finite fragments of bounded arithmetical theories
• Fragments of bounded arithmetic and the lengths of proofs
• A Conservation Result Concerning Bounded Theories and the Collection Axiom
• Preservation theorems and restricted consistency statements in bounded arithmetic
• A note on the \(\Sigma_1\) collection scheme and fragments of bounded arithmetic
• Unprovability of consistency statements in fragments of bounded arithmetic
• Finiteness axioms on fragments of intuitionistic set theory
• Hierarchical incompleteness results for arithmetically definable extensions of fragments of arithmetic

zbMATH Keywords

conservationaxiomatizationreplacementfragments of Bounded Arithmetic

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30)

Cited In (20)

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

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3476809)