Skip to main navigation Skip to search Skip to main content

FIXED-POINT THEOREMS FOR NON-TRANSITIVE RELATIONS

  • National Institute of Informatics (NII)
  • CNRS UMI3527
  • National Institute of Advanced Industrial Science and Technology

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

Abstract

In this paper, we develop an Isabelle/HOL library of order-theoretic fixed-point theorems. We keep our formalization as general as possible: we reprove several well-known results about complete orders, often with only antisymmetry or attractivity, a mild condition implied by either antisymmetry or transitivity. In particular, we generalize various theorems ensuring the existence of a quasi-fixed point of monotone maps over complete relations, and show that the set of (quasi-)fixed points is itself complete. This result generalizes and strengthens theorems of Knaster–Tarski, Bourbaki–Witt, Kleene, Markowsky, Pataraia, Mashburn, Bhatta–George, and Stouti–Maaden.

Original languageEnglish
Article number24
JournalLogical Methods in Computer Science
Volume18
Issue number1
DOIs
Publication statusPublished - 1 Jan 2022
Externally publishedYes

Keywords

  • Fixed-Points
  • Isabelle/HOL
  • Lattice Theory
  • Order Theory

Fingerprint

Dive into the research topics of 'FIXED-POINT THEOREMS FOR NON-TRANSITIVE RELATIONS'. Together they form a unique fingerprint.

Cite this