Tree‐Properties for Ordered Sets

&
Mathematical Logic Quarterly 48 (2):213-219 (2002)
  Copy   BIBTEX

Abstract

In this paper, we study the notion of arborescent ordered sets, a generalizationof the notion of tree-property for cardinals. This notion was already studied previously in the case of directed sets. Our main result gives a geometric condition for an order to be ℵ0-arborescent

Categories

Keywords

Reprint years

DOI

10.1002/1521-3870(200202)48:2

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,075

External links

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

Through your library

My notes

Similar books and articles

Combinatorial Criteria for Ramifiable Ordered Sets.R. Hinnion & O. Esser - 2001 - Mathematical Logic Quarterly 47 (4):539-556.
Large Cardinals and Ramifiability for Directed Sets.R. Hinnion & O. Esser - 2000 - Mathematical Logic Quarterly 46 (1):25-34.
Fragility and indestructibility of the tree property.Spencer Unger - 2012 - Archive for Mathematical Logic 51 (5-6):635-645.
Cellularity of Pseudo-Tree Algebras.Jennifer Brown - 2006 - Notre Dame Journal of Formal Logic 47 (3):353-359.
Finite Tree Property for First-Order Logic with Identity and Functions.Merrie Bergmann - 2005 - Notre Dame Journal of Formal Logic 46 (2):173-180.
On the Consistency of a Positive Theory.Olivier Esser - 1999 - Mathematical Logic Quarterly 45 (1):105-116.
A special class of almost disjoint families.Thomas E. Leathrum - 1995 - Journal of Symbolic Logic 60 (3):879-891.
On the consistency of the definable tree property on ℵ.Amir Leshem - 2000 - Journal of Symbolic Logic 65 (3):1204 - 1214.
A theorem on partial conservativity in arithmetic.Per Lindström - 2011 - Journal of Symbolic Logic 76 (1):341 - 347.
Definition 1.1. 1. A tree is a subset T of< such that for all∈ T, if∈< and⊆, then∈ T. 2. If T is a tree and S⊆ T is also a tree, we say that S is a subtree of T. 3. A tree T is bounded if there exists h:→ such that for all∈ T. [REVIEW]Joseph R. Mileti - 2005 - Bulletin of Symbolic Logic 11 (3).
Club degrees of rigidity and almost Kurepa trees.Gunter Fuchs - 2013 - Archive for Mathematical Logic 52 (1-2):47-66.
A blend of methods of recursion theory and topology: A Π1 0 tree of shadow points. [REVIEW]Iraj Kalantari & Larry Welch - 2004 - Archive for Mathematical Logic 43 (8):991-1008.
Partially ordered sets and the independence property.James H. Schmerl - 1989 - Journal of Symbolic Logic 54 (2):396-401.
The consistency strength of successive cardinals with the tree property.Matthew Foreman, Menachem Magidor & Ralf-Dieter Schindler - 2001 - Journal of Symbolic Logic 66 (4):1837-1847.

Analytics

Added to PP
2013-12-01

Downloads
27 (#590,878)

6 months
3 (#980,137)

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