scientific article
From MaRDI portal
Publication:3138831
zbMath0793.03057MaRDI QIDQ3138831
Publication date: 11 November 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
rewrite systemsfragments of first order arithmeticproof theoretic characterisations of termination orderings
First-order arithmetic and fragments (03F30) Grammars and rewriting systems (68Q42) Proof theory in general (including proof-theoretic semantics) (03F03)
Related Items
Equational derivation vs. computation, 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, Sometimes slow growing is fast growing, The hierarchy of terminating recursive programs over N, Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths, Term rewriting theory for the primitive recursive functions, Termination proofs by multiset path orderings imply primitive recursive derivation lengths, Derivation lengths and order types of Knuth--Bendix orders, The Hydra battle and Cichon's principle, A lexicographic path order with slow growing derivation bounds, Some results on cut-elimination, provable well-orderings, induction and reflection
