Well-founded recursive relations

DOI10.1007/3-540-44802-0_34MaRDI QIDQ4783327zbMATH OpenFDO

Authors Jean Goubault-Larrecq

Publication date 4 December 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2142/21420484

zbMATH Keywords

automatagraphshigher-order path orderingsKnuth-Bendix orderingslambda-calculuspath orderingsterminationwell-foundedness

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• Recursion, induction and well-founded orders
• Computer Aided Systems Theory – EUROCAST 2005
• Recursive set relations
• Complete, Recursively Enumerable Relations in Arithmetic
• Recursive properties of relations on models
• Relations Intrinsically Recursive in Linear Orders
• Well-founded Relations in Type Theory
• Recursive definitions and fixed-points on well-founded structures
• Recursive functions and existentially closed structures

Cited in

(9)

• Jumping and escaping: modular termination and the abstract path ordering
• Dependent choice as a termination principle
• On the Computational Content of Termination Proofs
• Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations
• The Computability Path Ordering: The End of a Quest
• On a duality between Kruskal and Dershowitz theorems
• On the union of well-founded relations
• Computer Aided Systems Theory – EUROCAST 2005
• Proving weak properties of rewriting

This page was built for publication: Well-founded recursive relations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4783327)