Essential Kurepa trees versus essential Jech–Kunen trees

Annals of Pure and Applied Logic 69 (1):107-131 (1994)
  Copy   BIBTEX

Abstract

By an ω1-tree we mean a tree of cardinality ω1 and height ω1. An ω1-tree is called a Kurepa tree if all its levels are countable and it has more than ω1 branches. An ω1-tree is called a Jech–Kunen tree if it has κ branches for some κ strictly between ω1 and 2ω1. A Kurepa tree is called an essential Kurepa tree if it contains no Jech–Kunen subtrees. A Jech–Kunen tree is called an essential Jech–Kunen tree if it is no Kurepa subtrees. In this paper we prove that it is consistent with CH and 2ω1 #62; ω2 that there exist essential Kurepa trees and there are no essential Jech–Kunen trees, it is consistent with CH and 2ω1 #62; ω2 plus the existence of a Kurepa tree with 2ω1 branches that there exist essential Jech–Kunen trees and there are no essential Kurepa trees. In the second result we require the existence of a Kurepa tree with 2ω1 branches in order to avoid triviality

Links

PhilArchive



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

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

The differences between Kurepa trees and Jech-Kunen trees.Renling Jin - 1993 - Archive for Mathematical Logic 32 (5):369-379.
Can a small forcing create Kurepa trees.Renling Jin & Saharon Shelah - 1997 - Annals of Pure and Applied Logic 85 (1):47-68.
Aronszajn and Kurepa trees.James Cummings - 2018 - Archive for Mathematical Logic 57 (1-2):83-90.
Club degrees of rigidity and almost Kurepa trees.Gunter Fuchs - 2013 - Archive for Mathematical Logic 52 (1-2):47-66.
On the spectra of cardinalities of branches of Kurepa trees.Márk Poór - 2021 - Archive for Mathematical Logic 60 (7):927-966.
Trees and Π 1 1 -Subsets of ω1 ω 1.Alan Mekler & Jouko Vaananen - 1993 - Journal of Symbolic Logic 58 (3):1052 - 1070.
Local coherence.Bernhard König - 2003 - Annals of Pure and Applied Logic 124 (1-3):107-139.
Square with built-in diamond-plus.Assaf Rinot & Ralf Schindler - 2017 - Journal of Symbolic Logic 82 (3):809-833.
Forcing with adequate sets of models as side conditions.John Krueger - 2017 - Mathematical Logic Quarterly 63 (1-2):124-149.
A model in which every Kurepa tree is thick.Renling Jin - 1991 - Notre Dame Journal of Formal Logic 33 (1):120-125.

Analytics

Added to PP
2014-01-16

Downloads
5 (#1,562,871)

6 months
17 (#161,763)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Can a small forcing create Kurepa trees.Renling Jin & Saharon Shelah - 1997 - Annals of Pure and Applied Logic 85 (1):47-68.

Add more citations

References found in this work

[Omnibus Review].Kenneth Kunen - 1969 - Journal of Symbolic Logic 34 (3):515-516.
Trees.Thomas J. Jech - 1971 - Journal of Symbolic Logic 36 (1):1-14.
A model in which every Kurepa tree is thick.Renling Jin - 1991 - Notre Dame Journal of Formal Logic 33 (1):120-125.
Some independence results related to the Kurepa tree.Renling Jin - 1991 - Notre Dame Journal of Formal Logic 32 (3):448-457.

View all 6 references / Add more references