Time bounded rewrite systems and termination proofs by generalized embedding
From MaRDI portal
Recommendations
- Termination proofs by multiset path orderings imply primitive recursive derivation lengths
- Termination proofs by multiset path orderings imply primitive recursive derivation lengths
- Termination proofs and the length of derivations
- scientific article; zbMATH DE number 408817
- scientific article; zbMATH DE number 3930339
Cites work
- Computability, complexity, logic. Transl. from the German
- Extensions and comparison of simplification orderings
- scientific article; zbMATH DE number 3857078 (Why is no real title available?)
- scientific article; zbMATH DE number 3810909 (Why is no real title available?)
- scientific article; zbMATH DE number 3905845 (Why is no real title available?)
- scientific article; zbMATH DE number 4090779 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- Incremental termination proofs and the length of derivations
- Orderings for term-rewriting systems
- Path of subterms ordering and recursive decomposition ordering revisited
- Termination proofs and the length of derivations
- Termination proofs by multiset path orderings imply primitive recursive derivation lengths
- Time bounded rewrite systems and termination proofs by generalized embedding
Cited in
(3)
This page was built for publication: Time bounded rewrite systems and termination proofs by generalized embedding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055749)