Pages that link to "Item:Q3195706"
From MaRDI portal
The following pages link to On the Computational Content of Termination Proofs (Q3195706):
Displaying 7 items.
- Analysing the implicit complexity of programs. (Q1401939) (← links)
- On the termination and structural termination problems for counter machines with incrementing errors (Q2037198) (← links)
- Dependent choice as a termination principle (Q2309508) (← links)
- (Q4016542) (← links)
- Incremental termination proofs and the length of derivations (Q5055748) (← links)
- Termination of Fair Computations in Term Rewriting (Q5387839) (← links)
- Interactive Termination Proofs Using Termination Cores (Q5747661) (← links)