Ordinal decompositions for preordered root systems

Annals of Pure and Applied Logic 161 (2):203-211 (2010)
  Copy   BIBTEX


In this paper, we explore the effects of certain forbidden substructure conditions on preordered sets. In particular, we characterize in terms of these conditions those preordered sets which can be represented as the supremum of a well-ordered ascending chain of lowersets whose members are constructed by means of alternating applications of disjoint union and ordinal sums with chains. These decompositions are examples of ordinal decompositions in relatively normal lattices as introduced by Snodgrass, Tsinakis, and Hart. We conclude the paper with an application to information systems



    Upload a copy of this work     Papers currently archived: 74,429

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Assignment of Ordinals to Patterns of Resemblance.Gunnar Wilken - 2007 - Journal of Symbolic Logic 72 (2):704 - 720.
Ordinal Arithmetic and $\sigma_{1}$ -Elementarity.Timothy J. Carlson - 1999 - Archive for Mathematical Logic 38 (7):449-460.
The Bachmann-Howard Structure in Terms of Σ1-Elementarity.Gunnar Wilken - 2006 - Archive for Mathematical Logic 45 (7):807-829.
Proof Theory and Ordinal Analysis.W. Pohlers - 1991 - Archive for Mathematical Logic 30 (5-6):311-376.
Fluctuations in the Dynamics of Single Quantum Systems.Anton Amann & Harald Atmanspacher - 1998 - Studies in History and Philosophy of Science Part B: Studies in History and Philosophy of Modern Physics 29 (2):151-182.
A Comparison of Two Systems of Ordinal Notations.Harold Simmons - 2004 - Archive for Mathematical Logic 43 (1):65-83.


Added to PP

9 (#929,158)

6 months
1 (#416,470)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references