A point on fixpoints in posets
Logic
2015-02-24 v1 Logic in Computer Science
Abstract
Let be a {\em non-empty strictly inductive poset}, that is, a non-empty partially ordered set such that every non-empty chain has a least upper bound lub, a chain being a subset of totally ordered by . We are interested in sufficient conditions such that, given an element and a function , there is some ordinal such that , where is the transfinite sequence of iterates of starting from (implying that is a fixpoint of ): \begin{itemize}\itemsep=0mm \item \item if is a limit ordinal, i.e. \end{itemize} This note summarizes known results about this problem and provides a slight generalization of some of them.
Keywords
Cite
@article{arxiv.1502.06021,
title = {A point on fixpoints in posets},
author = {Frédéric Blanqui},
journal= {arXiv preprint arXiv:1502.06021},
year = {2015}
}