The paper defines operational inexpressibility for step-duplicating primitive recursors in term rewriting and classifies sound responses into construction or confession methods while linking them to reflection hierarchies via an LCEL schema.
Termination of term rewriting using dependency pairs.Theoret- ical Computer Science, 236(1–2):133–178, 2000
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Operational Inexpressibility at the Step-Duplicating Primitive Recursor Orientation Boundary
The paper defines operational inexpressibility for step-duplicating primitive recursors in term rewriting and classifies sound responses into construction or confession methods while linking them to reflection hierarchies via an LCEL schema.