For a finite ground set X, this paper investigates properties of the set of orders with the fixed point property as a subset of the set 𝒪(X) of all orders on X, ordered by inclusion. In particular, it is shown that this set can have singleton components in the covering graph of 𝒪(X), we identify longest possible chains of orders such that orders alternate between having and not having the fixed point property, and we give examples of nondismantlable orders with the fixed point property such that every upper cover in 𝒪(X) has the fixed point property, too
The basic Zermelo-Bourbaki fixed point principle is being enlarged from a technical viewpoint. Some ...
Analogous to the fixed point property for ordered sets, a graph has the fixed vertex property if eac...
Two fixed point theorems implementing a more general principle for partially ordered sets (which is ...
AbstractAn elementary combinatorial proof is presented of the following fixed point theorem: Let P b...
We prove that, for a finite ordered set P that contains no crowns with 6 or more elements, it can be...
The ordered sets field is an important part of the ongoing mathematical, algorithmic and combinatori...
AbstractThe fixed-point construction of Scott, giving a continuous lattice solution of equations X ≅...
AbstractThis survey exhibits various algorithms to decide the question if a given ordered set P has ...
We prove that first order logic is strictly weaker than fixed point logic over every infinite classe...
This chapter gives an overview how retractions are used to prove fixed point results in ordered sets...
International audienceIn this paper, we develop an Isabelle/HOL library of order-theoretic concepts,...
AbstractWe propose a new approach towards proving that the fixed point property for ordered sets is ...
In this paper, we develop an Isabelle/HOL library of order-theoreticfixed-point theorems. We keep ou...
We provide a polynomial time algorithm that identifies if a given finite ordered set is in the class...
AbstractIt is proved that the fixed point property is a comparability invariant for the class of cha...
The basic Zermelo-Bourbaki fixed point principle is being enlarged from a technical viewpoint. Some ...
Analogous to the fixed point property for ordered sets, a graph has the fixed vertex property if eac...
Two fixed point theorems implementing a more general principle for partially ordered sets (which is ...
AbstractAn elementary combinatorial proof is presented of the following fixed point theorem: Let P b...
We prove that, for a finite ordered set P that contains no crowns with 6 or more elements, it can be...
The ordered sets field is an important part of the ongoing mathematical, algorithmic and combinatori...
AbstractThe fixed-point construction of Scott, giving a continuous lattice solution of equations X ≅...
AbstractThis survey exhibits various algorithms to decide the question if a given ordered set P has ...
We prove that first order logic is strictly weaker than fixed point logic over every infinite classe...
This chapter gives an overview how retractions are used to prove fixed point results in ordered sets...
International audienceIn this paper, we develop an Isabelle/HOL library of order-theoretic concepts,...
AbstractWe propose a new approach towards proving that the fixed point property for ordered sets is ...
In this paper, we develop an Isabelle/HOL library of order-theoreticfixed-point theorems. We keep ou...
We provide a polynomial time algorithm that identifies if a given finite ordered set is in the class...
AbstractIt is proved that the fixed point property is a comparability invariant for the class of cha...
The basic Zermelo-Bourbaki fixed point principle is being enlarged from a technical viewpoint. Some ...
Analogous to the fixed point property for ordered sets, a graph has the fixed vertex property if eac...
Two fixed point theorems implementing a more general principle for partially ordered sets (which is ...