![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Order - A Journal on the Theory of Ordered Sets and its Applications, Volume 32
Volume 32, Number 1, March 2015
- Gerrit Grenzebach, Björn Walker:
Shellability and Regularity of Chain Complexes over a Principal Ideal Domain. 1-28 - Denis I. Saveliev:
Ultrafilter Extensions of Linearly Ordered Sets. 29-41 - Graham R. Brightwell, Mitchel T. Keller:
The Reversal Ratio of a Poset. 43-52 - Salma Kuhlmann, Mickaël Matusinski
:
The Exponential-Logarithmic Equivalence Classes of Surreal Numbers. 53-68 - Bohuslav Balcar, Michal Doucha, Michael Hrusák
:
Base Tree Property. 69-81 - Milos S. Kurilic, Borisa Kuzeljevic
:
Maximal Chains of Isomorphic Suborders of Countable Ultrahomogeneous Partial Orders. 83-99 - Lankun Guo, Qingguo Li
:
The Categorical Equivalence Between Algebraic Domains and F-Augmented Closure Spaces. 101-116 - Ádám Kunos
:
Definability in the Embeddability Ordering of Finite Directed Graphs. 117-133 - Jorge Bruno
:
Pathological and Highly Transitive Representations of Free Groups. 135-144 - David Eppstein, Veit Wiechert:
Erratum to: Antimatroids and Balanced Pairs. 145-146
Volume 32, Number 2, July 2015
- Stefan Felsner, Thibault Manneville:
Linear Extensions of N-free Orders. 147-155 - Pete L. Clark:
A Note on Euclidean Order Types. 157-178 - Bostjan Bresar, Tanja Gologranc, Manoj Changat
, Baiju Sukumaran:
Cographs Which are Cover-Incomparability Graphs of Posets. 179-187 - David J. Foulis
, Sylvia Pulmannová:
Unitizing a Generalized Pseudo Effect Algebra. 189-204 - Sophie Huczynska
, Nik Ruskuc
:
Homomorphic Image Orders on Combinatorial Structures. 205-226 - Jimmie Lawson, Xiaoyong Xi:
The Equivalence of QRB, QFS, and Compactness for Quasicontinuous Domains. 227-238 - A. Abogatma, John Kenneth Truss:
Countable Homogeneous Lattices. 239-243 - Ralph Freese
, James B. Nation:
Projective Ordinal Sums of Lattices and Isotone Sections. 245-254 - Miguel Couceiro
, Erkko Lehtonen
, Karsten Schölzel
:
Hypomorphic Sperner Systems and Non-Reconstructible Functions. 255-292 - Csaba Biró, Peter Hamburger, Attila Pór:
Standard Examples as Subposets of Posets. 293-299
Volume 32, Number 3, November 2015
- Markus Szymik:
Homotopies and the Universal Fixed Point Property. 301-311 - Aistis Atminas, Vadim V. Lozin
:
Labelled Induced Subgraphs and Well-Quasi-Ordering. 313-328 - Ulrich Höhle
:
Prime Elements of Non-integral Quantales and their Applications. 329-346 - Charles L. Dunn
, David Morawski, Jennifer Nordstrom:
The Relaxed Edge-Coloring Game and k-Degenerate Graphs. 347-361 - Bernd S. W. Schröder
:
The Fixed Vertex Property for Graphs. 363-377 - Jennifer Anne Brown:
Character of Pseudo-Tree Algebras. 379-386 - Riccardo Camerlo, Raphaël Carroy
, Alberto Marcone
:
Epimorphisms Between Linear Orders. 387-400 - Peter J. Dukes
:
Generalized Laminar Families and Certain Forbidden Matrices. 401-408 - Jimmie Lawson, Xiaoyong Xi:
Continuity of Function Spaces from Pointwise Directed Families of Characteristic Functions. 409-418 - Gyula O. H. Katona, Dániel T. Nagy:
Incomparable Copies of a Poset in the Boolean Lattice. 419-427 - Andrew P. Dove
, Jerrold R. Griggs:
Packing Posets in the Boolean Lattice. 429-438 - Gejza Jenca
:
Effect Algebras are the Eilenberg-Moore Category for the Kalmbach Monad. 439-448 - Jean B. Nganou:
Profinite MV-algebras and Multisets. 449-459
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.