scientific article; zbMATH DE number 2110622

MaRDI QIDQ4823142zbMATH OpenFDO

Authors Geoffrey E. Ostrin, Stanley S. Wainer

Publication date 26 October 2004

zbMATH Keywords

computational complexitycut eliminationlogical complexityprovably recursive functionsordinal boundsequation calculusweak theory of arithmetic

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Complexity of proofs (03F20) First-order arithmetic and fragments (03F30) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20)

Recommendations

• New Computational Paradigms
• Weak theories of operations and types
• Proof theoretic complexity of low subrecursive classes
• A feasible theory for analysis
• scientific article; zbMATH DE number 1848310

Cited in

(25)

• Inductive definitions over a predicative arithmetic
• Techniques in weak analysis for conservation results
• Proof Complexity and the Kneser-Lovász Theorem
• Proof complexity of modal resolution
• scientific article; zbMATH DE number 4095440 (Why is no real title available?)
• Feasible functions over co-inductive data
• scientific article; zbMATH DE number 440481 (Why is no real title available?)
• New Computational Paradigms
• scientific article; zbMATH DE number 2212138 (Why is no real title available?)
• Mining the surface: witnessing the low complexity theorems of arithmetic
• Tiered arithmetics
• scientific article; zbMATH DE number 7753415 (Why is no real title available?)
• scientific article; zbMATH DE number 1916823 (Why is no real title available?)
• Elementary arithmetic
• scientific article; zbMATH DE number 2222029 (Why is no real title available?)
• scientific article; zbMATH DE number 2161249 (Why is no real title available?)
• Proof theoretic complexity of low subrecursive classes
• Complexity of Null- and Positivstellensatz proofs
• On the complexity of proof deskolemization
• scientific article; zbMATH DE number 937384 (Why is no real title available?)
• scientific article; zbMATH DE number 2086404 (Why is no real title available?)
• Intrinsic theories and computational complexity
• Weak theories of operations and types
• Proof Complexity of Non-classical Logics
• Inductive Complexity of Goodstein’s Theorem

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