Combinatorial Criteria for Ramifiable Ordered Sets

Mathematical Logic Quarterly 47 (4):539-556 (2001)
  Copy   BIBTEX

Abstract

The tree-property and its variants make sense also for directed sets and even for partially ordered sets. A combinatoria approach is developed here, with characterizations and criteria involving adequate families of special substructures of directed sets. These substructures form a natural hierarchy that is also investigated

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,031

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

Tree‐Properties for Ordered Sets.Olivier Esser & Roland Hinnion - 2002 - Mathematical Logic Quarterly 48 (2):213-219.
Large Cardinals and Ramifiability for Directed Sets.R. Hinnion & O. Esser - 2000 - Mathematical Logic Quarterly 46 (1):25-34.
Tree-Properties for Ordered Sets.Olivier Esser & Roland Hinnion - 2002 - Mathematical Logic Quarterly 48 (2):213-219.
Partially ordered sets and the independence property.James H. Schmerl - 1989 - Journal of Symbolic Logic 54 (2):396-401.
Ramifiable Directed Sets.Roland Hinnion - 1998 - Mathematical Logic Quarterly 44 (2):216-228.
On the minimal cover property and certain notions of finite.Eleftherios Tachtsis - 2018 - Archive for Mathematical Logic 57 (5-6):665-686.
Constructive Order Theory.Marcel Erné - 2001 - Mathematical Logic Quarterly 47 (2):211-222.

Analytics

Added to PP
2013-12-01

Downloads
5 (#1,561,562)

6 months
1 (#1,516,001)

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