東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Trees, Refining, and Combinatorial C...

Galgon, Geoff.

FindBook

Google Book

Amazon

博客來

Trees, Refining, and Combinatorial Characteristics.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Trees, Refining, and Combinatorial Characteristics./
作者:	Galgon, Geoff.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2016,
面頁冊數:	217 p.
附註:	Source: Dissertation Abstracts International, Volume: 78-03(E), Section: B.
Contained By:	Dissertation Abstracts International78-03B(E).
標題:	Mathematics. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10168519
ISBN:	9781369228038

Trees, Refining, and Combinatorial Characteristics.
Galgon, Geoff.

Trees, Refining, and Combinatorial Characteristics. - Ann Arbor : ProQuest Dissertations & Theses, 2016 - 217 p.

Source: Dissertation Abstracts International, Volume: 78-03(E), Section: B.

Thesis (Ph.D.)--University of California, Irvine, 2016.

The analysis of trees and the study of cardinal characteristics are both of historical and contemporary importance to set theory. In this thesis we consider each of these topics as well as questions relating to (almost) disjoint refinements. We show how structural information about trees and other similar objects is revealed by investigating the determinacy of certain two player games played on them. The games we investigate have classical analogues and can be used to prove structural dichotomies and related results. We also use them to find generalizations of the topological notions of perfectness and scatteredness for spaces like 2kappa and P kappalambda and form connections to when a submodel is e.g. '' T-guessing" for a certain tree T. Questions surrounding generalizations of the cardinal characteristics t (the tower number), h (the distributivity number), and non( M) (the uniformity number for category) in particular are considered. For example, we ask whether or not h(kappa) can be defined in a reasonable way. We give several impediments. Generalizations of a combinatorial characterization of non(M) in terms of countably matching families of functions become central for our investigation, and we show how characteristics relating to these generalizations can be manipulated by forcing. Similarly, the question of in which contexts can outer models can add strongly disjoint functions is considered. While Larson has shown that this is possible with a proper forcing at o1, and it is a corollary of a result of Abraham and Shelah that it is consistently impossible at o2, we note with Radin forcing that if kappa has a sufficient amount of measurable reflection, then it can be done at kappa. Turning to the theory of disjoint refinements, we generalize a recent result of Brendle, and independently Balcar and Pazak, that any time a real is added in an extension, the set of ground model reals can be almost disjointly refined to the setting of adding subsets of kappa, and consider related topics.

ISBN: 9781369228038Subjects--Topical Terms:

515831
Mathematics.

Trees, Refining, and Combinatorial Characteristics.
LDR:02915nmm a2200289 4500 001 2117694
005 20170530090537.5
008 180830s2016 ||||||||||||||||| ||eng d
020 $a 9781369228038
035 $a (MiAaPQ)AAI10168519
035 $a AAI10168519
040 $a MiAaPQ $c MiAaPQ
100 1 $a Galgon, Geoff. $3 3279483
245 1 0 $a Trees, Refining, and Combinatorial Characteristics.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2016
300 $a 217 p.
500 $a Source: Dissertation Abstracts International, Volume: 78-03(E), Section: B.
500 $a Adviser: Martin Zeman.
502 $a Thesis (Ph.D.)--University of California, Irvine, 2016.
520 $a The analysis of trees and the study of cardinal characteristics are both of historical and contemporary importance to set theory. In this thesis we consider each of these topics as well as questions relating to (almost) disjoint refinements. We show how structural information about trees and other similar objects is revealed by investigating the determinacy of certain two player games played on them. The games we investigate have classical analogues and can be used to prove structural dichotomies and related results. We also use them to find generalizations of the topological notions of perfectness and scatteredness for spaces like 2kappa and P kappalambda and form connections to when a submodel is e.g. '' T-guessing" for a certain tree T. Questions surrounding generalizations of the cardinal characteristics t (the tower number), h (the distributivity number), and non( M) (the uniformity number for category) in particular are considered. For example, we ask whether or not h(kappa) can be defined in a reasonable way. We give several impediments. Generalizations of a combinatorial characterization of non(M) in terms of countably matching families of functions become central for our investigation, and we show how characteristics relating to these generalizations can be manipulated by forcing. Similarly, the question of in which contexts can outer models can add strongly disjoint functions is considered. While Larson has shown that this is possible with a proper forcing at o1, and it is a corollary of a result of Abraham and Shelah that it is consistently impossible at o2, we note with Radin forcing that if kappa has a sufficient amount of measurable reflection, then it can be done at kappa. Turning to the theory of disjoint refinements, we generalize a recent result of Brendle, and independently Balcar and Pazak, that any time a real is added in an extension, the set of ground model reals can be almost disjointly refined to the setting of adding subsets of kappa, and consider related topics.
590 $a School code: 0030.
650 4 $a Mathematics. $3 515831
650 4 $a Theoretical mathematics. $3 3173530
690 $a 0405
690 $a 0642
710 2 $a University of California, Irvine. $b Mathematics. $3 2103885
773 0 $t Dissertation Abstracts International $g 78-03B(E).
790 $a 0030
791 $a Ph.D.
792 $a 2016
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10168519