Publication:3138831

zbMATH Open0793.03057MaRDI QIDQ3138831FDOQ3138831

E. A. Cichon

Publication date: 11 November 1993

Title of this publication is not available (Why is that?)

zbMATH Keywords

rewrite systemsfragments of first order arithmeticproof theoretic characterisations of termination orderings

Mathematics Subject Classification ID

Proof theory in general (including proof-theoretic semantics) (03F03) Grammars and rewriting systems (68Q42) First-order arithmetic and fragments (03F30)

Cited In (14)

• A lexicographic path order with slow growing derivation bounds
• Equational derivation vs. computation
• Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones
• Well partial orders
• The hierarchy of terminating recursive programs over N
• Termination proofs by multiset path orderings imply primitive recursive derivation lengths
• Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths
• On the Computational Content of Termination Proofs
• The Hydra battle and Cichon's principle
• Sometimes slow growing is fast growing
• Derivation lengths and order types of Knuth--Bendix orders
• Proof-theoretic analysis of termination proofs
• Some results on cut-elimination, provable well-orderings, induction and reflection
• Term rewriting theory for the primitive recursive functions

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