scientific article; zbMATH DE number 432704

MaRDI QIDQ3138831zbMATH OpenFDO

Authors E. A. Cichon

Publication date 11 November 1993

zbMATH Keywords

fragments of first order arithmeticproof theoretic characterisations of termination orderingsrewrite systems

Mathematics Subject Classification ID

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

Cited in

(14)

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

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)