Passer à la navigation principale Passer à la recherche Passer au contenu principal

FIXED-POINT THEOREMS FOR NON-TRANSITIVE RELATIONS

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

Résultats de recherche: Contribution à un journalArticleRevue par des pairs

1 Citation (Scopus)

Résumé

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.

langue originaleAnglais
Numéro d'article24
journalLogical Methods in Computer Science
Volume18
Numéro de publication1
Les DOIs
étatPublié - 1 janv. 2022
Modification externeOui

Empreinte digitale

Examiner les sujets de recherche de « FIXED-POINT THEOREMS FOR NON-TRANSITIVE RELATIONS ». Ensemble, ils forment une empreinte digitale unique.

Contient cette citation