scientific article; zbMATH DE number 2110622
zbMATH Open1057.03048MaRDI QIDQ4823142FDOQ4823142
Authors: Geoffrey E. Ostrin, Stanley S. Wainer 
Publication date: 26 October 2004
Title of this publication is not available (Why is that?)
Recommendations
computational complexitycut eliminationlogical complexityprovably recursive functionsordinal boundsequation calculusweak theory of arithmetic
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)
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
- Title not available (Why is that?)
- Feasible functions over co-inductive data
- Title not available (Why is that?)
- New Computational Paradigms
- Mining the surface: witnessing the low complexity theorems of arithmetic
- Title not available (Why is that?)
- Tiered arithmetics
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Elementary arithmetic
- Title not available (Why is that?)
- Complexity of Null- and Positivstellensatz proofs
- Proof theoretic complexity of low subrecursive classes
- On the complexity of proof deskolemization
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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)
