scientific article; zbMATH DE number 440477

MaRDI QIDQ3140634zbMATH OpenFDO

Authors Jan Krajíček, Gaisi Takeuti, Samuel R. Buss

Publication date 2 December 1993

zbMATH Keywords

conservation resultsdefinable functionsfragments of bounded arithmeticprovably total functionswitnessing theorems

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) First-order arithmetic and fragments (03F30)

Recommendations

• Structure and definability in general bounded arithmetic theories
• Fragments of Bounded Arithmetic and Bounded Query Classes
• Provably total functions of intuitionistic bounded arithmetic
• Conservative fragments of \({{S}^{1}_{2}}\) and \({{R}^{1}_{2}}\)
• scientific article; zbMATH DE number 4059391

Cited in

(16)

• On parallel hierarchies and R_k^i
• Determining inference semantics for disjunctive logic programs
• Characterising polynomial time computable functions using theories with weak set existence principles
• scientific article; zbMATH DE number 440487 (Why is no real title available?)
• scientific article; zbMATH DE number 4006252 (Why is no real title available?)
• Provably total functions of intuitionistic bounded arithmetic
• An unexpected separation result in Linearly Bounded Arithmetic
• Provably total functions of Basic Arithmetic
• Omission-based abstraction for answer set programs
• The computational power of bounded arithmetic from the predicative viewpoint
• Witnesses for Answer Sets of Logic Programs
• On parallel hierarchies and R ki
• Mining the surface: witnessing the low complexity theorems of arithmetic
• Contrastive explanations for answer-set programs
• Witnessing flows in arithmetic
• Polynomially bounded recursive realizability

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 Q3140634)