Fixed Points Theorems for Non-Transitive Relations
@article{Dubut2022FixedPT, title={Fixed Points Theorems for Non-Transitive Relations}, author={J{\'e}r{\'e}my Dubut and Akihisa Yamada}, journal={Log. Methods Comput. Sci.}, year={2022}, volume={18} }
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…
References
SHOWING 1-10 OF 35 REFERENCES
Proving Fixed Points
- MathematicsFICS
- 2010
We propose a method to characterize the fixed points described in Tarski's theorem for complete lattices. The method is deductive: the least and greatest fixed points are "proved" in some inference…
Fixed points and common fixed points theorems in pseudo-ordered sets
- Mathematics
- 2013
Under suitable conditions, we establish the existence of the greatest and the least fixed points of monotone maps defined on nonempty pseudo-ordered sets. Also, we prove that the set of all common…
Chain-complete posets and directed sets with applications
- Mathematics
- 1976
Let a poset P be called chain-complete when every chain, including the empty chain, has a sup in P. Many authors have investigated properties of posets satisfying some sort of chain-completeness…
The least fixed point property for omega-chain continuous functions
- Houston Journal of Mathematics, 9(2):231–244
- 1983
Weak chain-completeness and fixed point property for pseudo-ordered sets
- Mathematics
- 2005
In this paper the notion of weak chain-completeness is introduced for pseudo-ordered sets as an extension of the notion of chain-completeness of posets (see [3]) and it is shown that every isotone…
Isabelle/HOL: A Proof Assistant for Higher-Order Logic
- Computer Science
- 2002
This presentation discusses Functional Programming in HOL, which aims to provide students with an understanding of the programming language through the lens of Haskell.
seL4: formal verification of an OS kernel
- Computer ScienceSOSP '09
- 2009
To the knowledge, this is the first formal proof of functional correctness of a complete, general-purpose operating-system kernel.
Random testing in Isabelle/HOL
- Computer ScienceProceedings of the Second International Conference on Software Engineering and Formal Methods, 2004. SEFM 2004.
- 2004
The Isabelle theorem prover is extended with a tool for testing specifications by evaluating propositions under an assignment of random values to free variables to save development time.
Some fixed point theorems for pseudo ordered sets
- Algebra and Discrete Mathematics, 11(1):17–22
- 2011