The differences between Kurepa trees and Jech-Kunen trees

Archive for Mathematical Logic 32 (5):369-379 (1993)
  Copy   BIBTEX

Abstract

By an ω1 we mean a tree of power ω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^{\omega _1 }$ . In Sect. 1, we construct a model ofCH plus $2^{\omega _1 } > \omega _2$ , in which there exists a Kurepa tree with not Jech-Kunen subtrees and there exists a Jech-Kunen tree with no Kurepa subtrees. This improves two results in [Ji1] by not only eliminating the large cardinal assumption for [Ji1, Theorem 2] but also handling two consistency proofs of [Ji1, Theorem 2 and Theorem 3] simultaneously. In Sect. 2, we first prove a lemma saying that anAxiom A focing of size ω1 over Silver's model will not produce a Kurepa tree in the extension, and then we apply this lemma to prove that, in the model constructed for Theorem 2 in [Ji1], there exists a Jech-Kunen tree and there are no Kurepa trees

Links

PhilArchive



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

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

Essential Kurepa trees versus essential Jech–Kunen trees.Renling Jin & Saharon Shelah - 1994 - Annals of Pure and Applied Logic 69 (1):107-131.
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.
Trees and Π 1 1 -Subsets of ω1 ω 1.Alan Mekler & Jouko Vaananen - 1993 - Journal of Symbolic Logic 58 (3):1052 - 1070.
Computability in uncountable binary trees.Reese Johnston - 2019 - Journal of Symbolic Logic 84 (3):1049-1098.
Square with built-in diamond-plus.Assaf Rinot & Ralf Schindler - 2017 - Journal of Symbolic Logic 82 (3):809-833.
Club degrees of rigidity and almost Kurepa trees.Gunter Fuchs - 2013 - Archive for Mathematical Logic 52 (1-2):47-66.
Σ1(κ)-definable subsets of H.Philipp Lücke, Ralf Schindler & Philipp Schlicht - 2017 - Journal of Symbolic Logic 82 (3):1106-1131.
Results on the Generic Kurepa Hypothesis.R. B. Jensen & K. Schlechta - 1990 - Archive for Mathematical Logic 30 (1):13-27.
Trees, fundamental groups and homology groups.Katsuya Eda & Masasi Higasikawa - 2001 - Annals of Pure and Applied Logic 111 (3):185-201.

Analytics

Added to PP
2013-11-23

Downloads
54 (#303,841)

6 months
13 (#219,656)

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.
Essential Kurepa trees versus essential Jech–Kunen trees.Renling Jin & Saharon Shelah - 1994 - Annals of Pure and Applied Logic 69 (1):107-131.

Add more citations

References found in this work

Set theory.Thomas Jech - 1981 - Journal of Symbolic Logic.
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.

Add more references