가야대학교 분성도서관

상단 글로벌/추가 메뉴

회원 로그인

주메뉴

: • 전체검색; • 단행본; • 정기간행물; • 학위논문; • 비도서; • 특정번호 검색; • 기사색인; • 학습연구지원; • 지정도서

: • 전자자원통합검색; • 해외 WEB DB; • E-Book; • E-Learning; • 국내 WEB DB; • 인터넷검색

: • 대출현황조회/연장; • 예약현황조회/취소; • 희망도서; • 내서재; • 나의서평; • 나의태그; • 나의위젯; • RSS; • SDI; • 개인정보관리

: • 공지사항; • FAQ; • Q&A 일반·학술; • 신착/인기 도서; • 학위논문온라인제출; • 외부인 이용안내; • 설문조사

: • 도서관 소개; • 연혁; • 현황; • 이용안내; • 찾아오시는 길

자료검색

Home
상세정보

상세정보

검색결과 돌아가기

부가기능

MARC보기

The Combinatorics and Absoluteness of Definable Sets of Real Numbers

상세 프로파일

상세정보
자료유형	E-Book
개인저자	Norwood, Zach.
단체저자명	University of California, Los Angeles. Mathematics 0540.
서명/저자사항	The Combinatorics and Absoluteness of Definable Sets of Real Numbers.
발행사항	[S.l.] : University of California, Los Angeles., 2018
발행사항	Ann Arbor : ProQuest Dissertations & Theses, 2018
형태사항	88 p.
소장본 주기	School code: 0031.
ISBN	9780438021716
일반주기	Source: Dissertation Abstracts International, Volume: 79-10(E), Section: A. Adviser: Itay Neeman.
요약	This thesis divides naturally into two parts, each concerned with the extent to which the theory of L(R) can be changed by forcing.
요약	The first part focuses primarily on applying generic-absoluteness principles to show that definable sets of reals enjoy regularity properties. We begin, in the spirit of Mathias, by establishing a strong Ramsey property for sets of reals in the
요약	In Chapter 3 we stray from the main line of inquiry to briefly study a game-theoretic characterization of filters with the Baire Property.
요약	Neeman and Zapletal showed, assuming roughly the existence of a proper class of Woodin cardinals, that the boldface theory of L( R) cannot be changed by proper forcing. They call their result the Embedding Theorem, because they conclude that in
요약	Part I concludes with Chapter 5, a short list of open questions.
요약	In the second part of the thesis, we conduct a finer analysis of the Embedding Theorem and its consistency strength. Schindler found that the the Embedding Theorem is consistent relative to much weaker assumptions than the existence of Woodin ca
요약	The proof of Theorem 6.2 splits naturally into two arguments. In Chapter 7 we extend Kunen's method of coding reals into a specializing function to allow for trees with uncountable levels that may not belong to L. This culminates in Theorem 7.4
요약	We complete the argument in Chapter 8, where we show that if the Tree Reflection Principle holds in every alpha-closed extension, then "special character omitted is remarkable in L.
요약	In Chapter 9 we review Schindler's proof of generic absoluteness from a remarkable cardinal to show that the argument gives a level-by-level upper bound.
요약	Chapter 10 is devoted to partially reversing the level-by-level upper bound of Chapter 9. We are able to show that L(R)-absoluteness for lambda-linked posets implies that the interval [kappa V1 ,lambda] is Sigma21-remarkable in L.
일반주제명	Logic.
언어	영어
기본자료 저록	Dissertation Abstracts International79-10A(E). Dissertation Abstract International
대출바로가기	http://www.riss.kr/pdu/ddodLink.do?id=T14998973