Pages that link to "Item:Q1899143"
From MaRDI portal
The following pages link to Proof-theoretic analysis of termination proofs (Q1899143):
Displaying 23 items.
- Reverse mathematical bounds for the termination theorem (Q324248) (← links)
- The Hydra battle and Cichon's principle (Q734036) (← links)
- Some results on cut-elimination, provable well-orderings, induction and reflection (Q1295413) (← links)
- The proof-theoretic strength of Ramsey's theorem for pairs and two colors (Q1644984) (← links)
- Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones (Q1908812) (← links)
- Dependent choice as a termination principle (Q2309508) (← links)
- Some interesting connections between the slow growing hierarchy and the Ackermann function (Q2747706) (← links)
- The Logic of Public Announcements, Common Knowledge, and Private Suspicions (Q2971701) (← links)
- Rice and Rice-Shapiro Theorems for transfinite correction grammars (Q3096086) (← links)
- Program Size Complexity of Correction Grammars in the Ershov Hierarchy (Q3188262) (← links)
- On the Computational Content of Termination Proofs (Q3195706) (← links)
- 2004 Summer Meeting of the Association for Symbolic Logic (Q3370624) (← links)
- Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations (Q3522031) (← links)
- A lexicographic path order with slow growing derivation bounds (Q3619873) (← links)
- TERMINATION OF ABSTRACT REDUCTION SYSTEMS (Q3620615) (← links)
- Learning correction grammars (Q3630576) (← links)
- Lexicographic Path Induction (Q3637202) (← links)
- Variations on a theme by Weiermann (Q4227873) (← links)
- How is it that infinitary methods can be applied to finitary mathematics? Gödel's <i>T</i>: a case study (Q4254685) (← links)
- (Q5009706) (← links)
- (Q5014441) (← links)
- Complexity Analysis by Rewriting (Q5458433) (← links)
- Derivation lengths and order types of Knuth--Bendix orders (Q5958622) (← links)
