Relation.Terminating
abbrevimported Lean
A relation is terminating when the inverse of its transitive closure is well-founded. Note that this is also called Noetherian or strongly normalizing in the literature.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in abbrev Relation.Terminating (r : α → α → Prop)
- Defined in
- CSLib, `Relation.Terminating`
- Lean proof
- By Fabrizio Montesi, Thomas Waring, Chris Henson, from github.com/leanprover/cslib at
3951377e5a3f(Copyright (c) 2025 Fabrizio Montesi and Thomas Waring. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.33.0.Relation.Terminating← Relation.Terminating (Cslib/Foundations/Relation/Defs.lean:98): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Used by 2
- Cslib.LTS.TerminatingAn LTS is terminating if its underlying unlabelled transition relation is terminating, equivalently if it admits no infinite execution.
- Relation.ConvergentA relation is convergent when it is both confluent and terminating.
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in /-- A relation is terminating when the inverse of its transitive closure is well-founded. Note that this is also called Noetherian or strongly normalizing in the literature. -/ abbrev Relation.Terminating (r : α → α → Prop) := WellFounded (fun a b => r b a)