Jónsson posets
From MaRDI portal
Publication:1991606
DOI10.1007/S00012-018-0551-7zbMATH Open1472.06001arXiv1712.09442OpenAlexW4243092413MaRDI QIDQ1991606FDOQ1991606
Authors: Roland Assous, Maurice Pouzet
Publication date: 30 October 2018
Published in: Algebra Universalis (Search for Journal in Brave)
Abstract: According to Kearnes and Oman (2013), an ordered set is emph{J'onsson} if it is infinite and the cardinality of every proper initial segment of is strictly less than the cardinaliy of . We examine the structure of J'onsson posets.
Full work available at URL: https://arxiv.org/abs/1712.09442
Recommendations
ordered setrelational structurewell-quasi-orderinguniformly recurrent wordsbetter-quasi-orderingordinal lengthJónsson algebra
Cites Work
- Unavoidable induced subgraphs in large graphs with no homogeneous sets
- Title not available (Why is that?)
- On unavoidable-induced subgraphs in large prime graphs
- Semiorders and a Theory of Utility Discrimination
- Automatic Sequences
- Intransitive indifference with unequal indifference intervals
- Foundational aspects of theories of measurement
- Interval graphs and interval orders
- Semiorders and thresholds of utility discrimination: solving the Scott-Suppes representability problem
- Substitutions in dynamics, arithmetics and combinatorics
- A bound on the dimension of interval orders
- Theory of relations. Transl. from the French by P. Clote. With an appendix by Norbert Sauer.
- The dimension of semiorders
- Semiorders. Properties, representations, applications
- Jónsson posets and unary Jónsson algebras
- From well-quasi-ordered sets to better-quasi-ordered sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Partially well ordered sets and partial ordinals
- Jaco-type graphs and black energy dissipation
- Poset algebras over well quasi-ordered posets
- On minimal prime graphs and posets
- Title not available (Why is that?)
- A note on Dilworth's theorem in the infinite case
- The length of an intersection
- A note on strongly Jónsson binary relational structures.
- Unavoidable subtournaments in large tournaments with no homogeneous sets
Cited In (4)
This page was built for publication: Jónsson posets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1991606)