Some Independence Results For Amenable Group Actions, Universal Graphs, and Construction Schemes

Simple item page
dc.contributor.advisorSteprans, Juris
dc.contributor.advisorSteprans, Juris
dc.creatorKalajdzievski, Damjan
dc.date.accessioned2019-07-02T16:17:57Z
dc.date.available2019-07-02T16:17:57Z
dc.date.copyright2019-01-17
dc.date.issued2019-07-02
dc.date.updated2019-07-02T16:17:57Z
dc.degree.disciplineMathematics & Statistics
dc.degree.levelDoctoral
dc.degree.namePhD - Doctor of Philosophy
dc.description.abstractThis thesis uses the technique of forcing to study consistency results in three areas: In the first chapter, we investigate the question of whether or not an amenable subgroup of the permutation group on N can have a unique invariant mean on its action. In joint work with Juris Steprans, we extend the work of Foreman in [13] and show that in the Cohen model such an amenable group with a unique invariant mean must fail to have slow growth rate and a certain weakened solvability condition. In the second chapter, the consistency of a universal graph on 1 with Martins Axiom the negation of the Continuum Hypothesis is investigated. We extend an argument of Shelah in [44] to get a partial result of the consistency of a universal graph on 1 with MA(Cohen), Suslins Hypothesis, and the negation of the Continuum Hypothesis. The third chapter is an investigation of forcing extensions answering some independence questions relating to construction schemes, which are combinatorial schemes for constructing objects with domain introduced by Todorcevic in [50]. In joint work with Fulgencio Lopez, we show that adding 1 Cohen reals adds a capturing construction scheme, that it is consistent to have n-capturing construction schemes but no (n+1)-capturing construction schemes, and show that MA(m-Knaster) and n-capturing are independent if n m and incompatible if n > m.
dc.identifier.urihttp://hdl.handle.net/10315/36292
dc.language.isoen
dc.rightsAuthor owns copyright, except where explicitly noted. Please contact the author directly with licensing requests.
dc.subjectLogic
dc.subject.keywordsset theory
dc.subject.keywordslogic
dc.subject.keywordsconstruction scheme
dc.subject.keywordsuniversal graph
dc.subject.keywordsuniversal
dc.subject.keywordsgraph
dc.subject.keywordsamenability
dc.subject.keywordsforcing
dc.titleSome Independence Results For Amenable Group Actions, Universal Graphs, and Construction Schemes
dc.typeElectronic Thesis or Dissertation

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Kalajdzievski_Damjan_2019_Phd.pdf
Size:
538.85 KB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 2 of 2
No Thumbnail Available
Name:
license.txt
Size:
1.87 KB
Format:
Plain Text
Description:
Download
No Thumbnail Available
Name:
YorkU_ETDlicense.txt
Size:
3.39 KB
Format:
Plain Text
Description:
Download

Collections

Mathematics & Statistics

All items in the YorkSpace institutional repository are protected by copyright, with all rights reserved except where explicitly noted.