no code implementations • 20 Jan 2021 • Paolo Baldan, Richard Eggert, Barbara König, Tomasso Padoan
Knaster-Tarski's theorem, characterising the greatest fixpoint of a monotone function over a complete lattice as the largest post-fixpoint, naturally leads to the so-called coinduction proof principle for showing that some element is below the greatest fixpoint (e. g., for providing bisimilarity witnesses).
Logic in Computer Science
