首页    期刊浏览 2024年11月28日 星期四
登录注册

文章基本信息

  • 标题:FIXED POINTS THEOREMS FOR NON-TRANSITIVE RELATIONS
  • 本地全文:下载
  • 作者:Jérémy Dubut ; Akihisa Yamada
  • 期刊名称:Logical Methods in Computer Science
  • 印刷版ISSN:1860-5974
  • 电子版ISSN:1860-5974
  • 出版年度:2022
  • 卷号:18
  • 期号:1
  • 页码:1-24
  • DOI:10.46298/lmcs-18(1:30)2022
  • 语种:English
  • 出版社:Technical University of Braunschweig
  • 摘要: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.
  • 关键词:Order Theory;Lattice Theory;Fixed-Points;Isabelle/HOL
国家哲学社会科学文献中心版权所有