AbstractReconstruction questions arise when studying interactions between the isomorphic type of a structure and the isomorphic types of its substructures. In this survey paper we are interested in binary relations and particularly we focus on partially ordered binary relations. We present most of the known results on partially ordered sets and that for different kinds of reconstruction: among them we have the Fraı¨ssé-reconstruction, the Ulam-reconstruction, the max-reconstruction and the set-reconstruction
In this paper, the notion of derivation on partially ordered sets or posets is introduced and studie...
AbstractIn this note we are dealing with Ulam's reconstruction conjecture applied to finite partiall...
We consider the classes of finite coloured partial orders, i.e., partial orders together with unary ...
AbstractReconstruction questions arise when studying interactions between the isomorphic type of a s...
AbstractIn this paper, we prove reconstruction results for truncated lattices. The main results are ...
AbstractWe show that there are nonisomorphic ordered sets P and Q that have the same maximal and min...
We explore lattice structures on integer binary relations (i.e. binary relations on the set $\{1, 2,...
AbstractA partial ordering is defined for monotone projections f: N → N, N = {1, 2,…, n}, such that ...
We study the relationship between algebraic structures and their inverse semigroups of partial autom...
AbstractWe study the relationship between algebraic structures and their inverse semigroups of parti...
AbstractWe propose a new approach towards proving that the fixed point property for ordered sets is ...
AbstractConcept lattices (also called Galois lattices) are an ordering of the maximal rectangles def...
summary:A distance between finite partially ordered sets is studied. It is a certain measure of the ...
A binary relation R on a set X is a set of ordered pairs of elements of X, that is, a subset of X ×X...
Reconstructing system dynamics from sequential data traces is an important algorithmic challenge wit...
In this paper, the notion of derivation on partially ordered sets or posets is introduced and studie...
AbstractIn this note we are dealing with Ulam's reconstruction conjecture applied to finite partiall...
We consider the classes of finite coloured partial orders, i.e., partial orders together with unary ...
AbstractReconstruction questions arise when studying interactions between the isomorphic type of a s...
AbstractIn this paper, we prove reconstruction results for truncated lattices. The main results are ...
AbstractWe show that there are nonisomorphic ordered sets P and Q that have the same maximal and min...
We explore lattice structures on integer binary relations (i.e. binary relations on the set $\{1, 2,...
AbstractA partial ordering is defined for monotone projections f: N → N, N = {1, 2,…, n}, such that ...
We study the relationship between algebraic structures and their inverse semigroups of partial autom...
AbstractWe study the relationship between algebraic structures and their inverse semigroups of parti...
AbstractWe propose a new approach towards proving that the fixed point property for ordered sets is ...
AbstractConcept lattices (also called Galois lattices) are an ordering of the maximal rectangles def...
summary:A distance between finite partially ordered sets is studied. It is a certain measure of the ...
A binary relation R on a set X is a set of ordered pairs of elements of X, that is, a subset of X ×X...
Reconstructing system dynamics from sequential data traces is an important algorithmic challenge wit...
In this paper, the notion of derivation on partially ordered sets or posets is introduced and studie...
AbstractIn this note we are dealing with Ulam's reconstruction conjecture applied to finite partiall...
We consider the classes of finite coloured partial orders, i.e., partial orders together with unary ...