An effective proof of the well-foundedness of the multiset path ordering
type: Item
instance of: scholarly article
title: An effective proof of the well-foundedness of the multiset path ordering
zbMATH Open document ID: 1107.68045
author: Solange Coupet-Grimal
author: William Delobel
published in: Applicable Algebra in Engineering, Communication and Computing
publication date: 2007-01-05T00:00:00Z
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 5081977
zbMATH Keywords: termination
zbMATH Keywords: well-foundedness
zbMATH Keywords: multiset path order
zbMATH Keywords: constructive logic
zbMATH Keywords: calculus of inductive constructions
describes a project that uses: Coq
describes a project that uses: CoLoR
MaRDI profile type: Publication
full work available at URL: s00200-006-0020-y
OpenAlex ID: W2018387388
cites work: Term Rewriting and All That
cites work: Q3703866
cites work: Computer Science Logic
cites work: Orderings for term-rewriting systems
cites work: Q3994895
cites work: Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
cites work: Q3024845
cites work: Q3667939
cites work: Q5734436
cites work: Q2778883
cites work: Q4552751
cites work: Structural Analysis of Narratives with the Coq Proof Assistant
cites work: An intuitionistic proof of Kruskal's theorem
DOI: 10.1007/S00200-006-0020-Y
description: scientific article; zbMATH DE number 5081977