Back to Search Start Over

FIXED-POINT THEOREMS FOR NON-TRANSITIVE RELATIONS.

Authors :
DUBUT, JÉRÉMY
AKIHISA YAMADA
Source :
Logical Methods in Computer Science (LMCS); 2022, Vol. 18 Issue 1, p1-24, 24p
Publication Year :
2022

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. [ABSTRACT FROM AUTHOR]

Subjects

Subjects :
EXISTENCE theorems
LATTICE theory

Details

Language :
English
ISSN :
18605974
Volume :
18
Issue :
1
Database :
Complementary Index
Journal :
Logical Methods in Computer Science (LMCS)
Publication Type :
Academic Journal
Accession number :
155389918
Full Text :
https://doi.org/10.46298/LMCS-18(1:30)2022