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

Complete non-orders and fixed points

  • National Institute of Informatics (NII)
  • CNRS UMI3527

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collection › Contribution à une conférence › Revue par des pairs

1 Citation (Scopus)

Résumé

In this paper, we develop an Isabelle/HOL library of order-theoretic concepts, such as various completeness conditions and fixed-point theorems. We keep our formalization as general as possible: we reprove several well-known results about complete orders, often without any property of ordering, thus complete non-orders. In particular, we generalize the Knaster–Tarski theorem so that we ensure the existence of a quasi-fixed point of monotone maps over complete non-orders, and show that the set of quasi-fixed points is complete under a mild condition – attractivity – which is implied by either antisymmetry or transitivity. This result generalizes and strengthens a result by Stauti and Maaden. Finally, we recover Kleene’s fixed-point theorem for omega-complete non-orders, again using attractivity to prove that Kleene’s fixed points are least quasi-fixed points.

langue originaleAnglais
titre10th International Conference on Interactive Theorem Proving, ITP 2019
rédacteurs en chefJohn Harrison, John O'Leary, Andrew Tolmach
EditeurSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronique)9783959771221
Les DOIs
étatPublié - 1 sept. 2019
Modification externeOui
Evénement10th International Conference on Interactive Theorem Proving, ITP 2019 - Portland, États-Unis
Durée: 9 sept. 2019 → 12 sept. 2019

Série de publications

NomLeibniz International Proceedings in Informatics, LIPIcs
Volume141
ISSN (imprimé)1868-8969

Une conférence

Une conférence10th International Conference on Interactive Theorem Proving, ITP 2019
Pays/TerritoireÉtats-Unis
La villePortland
période9/09/19 → 12/09/19

Empreinte digitale

Examiner les sujets de recherche de « Complete non-orders and fixed points ». Ensemble, ils forment une empreinte digitale unique.

Contient cette citation