We show that there are uncountably many countable homogeneous lattices. We give a discussion of which such lattices can be modular or distributive. The method applies to show that certain other classes of structures also have uncountably many homogeneous members.
In this paper we investigate the connection between infinite permutation monoids and bimorphism mono...
Let U = (U, L) be a universal binary countable homogeneous structure and n ∈ ω. We determine the equ...
Using known facts we give a simple characterization of the distributivity of lattices of finite leng...
(joint work with Aisha Abogatma) Previously a rather short list of countable homogeneous lattice...
AbstractA relational first order structure is homogeneous if it is countable (possibly finite) and e...
A countable relational structure $M$ is called $ extit{set-homogeneous}$ if whenever two finite subs...
AbstractA relational structure A is called k-homogeneous if each isomorphism between two k-element s...
AbstractA relational structure is called homogeneous if each isomorphism between its finite substruc...
AbstractWe show that in the case of 2-dimensional lattices, Quebbemann's notion of modular and stron...
We show that in the case of 2-dimensional lattices, Quebbemann's notion of modular and strongly modu...
Because lattice theory is so vast, the primary purpose of this paper will be to present some of the ...
AbstractWe give a classification of all the countable homogeneous multipartite graphs. This generali...
International audienceA lattice L is spatial if every element of L is a join of completely join-irre...
We study countable embedding-universal and homomorphism-universal structures and unify results relat...
AbstractWe completely characterize those distributive lattices which can be obtained as elementary s...
In this paper we investigate the connection between infinite permutation monoids and bimorphism mono...
Let U = (U, L) be a universal binary countable homogeneous structure and n ∈ ω. We determine the equ...
Using known facts we give a simple characterization of the distributivity of lattices of finite leng...
(joint work with Aisha Abogatma) Previously a rather short list of countable homogeneous lattice...
AbstractA relational first order structure is homogeneous if it is countable (possibly finite) and e...
A countable relational structure $M$ is called $ extit{set-homogeneous}$ if whenever two finite subs...
AbstractA relational structure A is called k-homogeneous if each isomorphism between two k-element s...
AbstractA relational structure is called homogeneous if each isomorphism between its finite substruc...
AbstractWe show that in the case of 2-dimensional lattices, Quebbemann's notion of modular and stron...
We show that in the case of 2-dimensional lattices, Quebbemann's notion of modular and strongly modu...
Because lattice theory is so vast, the primary purpose of this paper will be to present some of the ...
AbstractWe give a classification of all the countable homogeneous multipartite graphs. This generali...
International audienceA lattice L is spatial if every element of L is a join of completely join-irre...
We study countable embedding-universal and homomorphism-universal structures and unify results relat...
AbstractWe completely characterize those distributive lattices which can be obtained as elementary s...
In this paper we investigate the connection between infinite permutation monoids and bimorphism mono...
Let U = (U, L) be a universal binary countable homogeneous structure and n ∈ ω. We determine the equ...
Using known facts we give a simple characterization of the distributivity of lattices of finite leng...
Add to ORKG