000			03289nam a22004693i 4500
001			EBC3114493
003			MiAaPQ
005			20240729124610.0
006			m o d |
007			cr cnu||||||||
008			240724s1999 xx o ||||0 eng d
020			_a9781470402624 _q(electronic bk.)
020			_z9780821811801
035			_a(MiAaPQ)EBC3114493
035			_a(Au-PeEL)EBL3114493
035			_a(CaPaEBR)ebr11041271
035			_a(OCoLC)922964847
040			_aMiAaPQ _beng _erda _epn _cMiAaPQ _dMiAaPQ
050		4	_aQA248 -- .R67 1999eb
082	0		_a510 s;511.3/22
100	1		_aRosłanowski, Andrzej.
245	1	0	_aNorms on Possibilities. I : _bForcing with Trees and Creatures.
250			_a1st ed.
264		1	_aProvidence : _bAmerican Mathematical Society, _c1999.
264		4	_c©1999.
300			_a1 online resource (186 pages)
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
490	1		_aMemoirs of the American Mathematical Society ; _vv.141
505	0		_aIntro -- Contents -- Annotated Content -- Abstract -- Chapter 0. Introduction -- 0.1. The content of the paper -- 0.2. Notation -- Chapter 1. Basic definitions -- 1.0. Prologue -- 1.1. Weak creatures and related forcing notions -- 1.2. Creatures -- 1.3. Tree creatures and tree-like forcing notions -- 1.4. Non proper examples -- Chapter 2. Properness and the reading of names -- 2.1. Forcing notions Q*[sub(s∞)](K,Σ), Q*[sub(w∞)](K,Σ) -- 2.2. Forcing notion Q*[sub(f)](K,Σ): bigness and halving -- 2.3. Tree-creating (K,Σ) -- 2.4. Examples -- Chapter 3. More properties -- 3.1. Old reals are dominating -- 3.2. Preserving non-meager sets -- 3.3. Preserving non-null sets -- 3.4. (No) Sacks Property -- 3.5. Examples -- Chapter 4. Omittory with Halving -- 4.1. What omittory may easily do -- 4.2. More operations on weak creatures -- 4.3. Old reals are unbounded -- 4.4. Examples -- Chapter 5. Around not adding Cohen reals -- 5.1. (f,g)-bounding -- 5.2. (t,F)-bounding -- 5.3. Quasi-generic Γ and preserving them -- 5.4. Examples -- Chapter 6. Playing with ultrafilters -- 6.1. Generating an ultrafilter -- 6.2. Between Ramsey and p-points -- 6.3. Preserving ultrafilters -- 6.4. Examples -- Chapter 7. Friends and relatives of PP -- 7.1. Balcerzak-Plewik number -- 7.2. An iterable friend of the strong PP-property -- 7.3. Bounded relatives of PP -- 7.4. Weakly non-reducible p-filters in iterations -- 7.5. Examples -- List of definitions -- Bibliography.
588			_aDescription based on publisher supplied metadata and other sources.
590			_aElectronic reproduction. Ann Arbor, Michigan : ProQuest Ebook Central, 2024. Available via World Wide Web. Access may be limited to ProQuest Ebook Central affiliated libraries.
650		0	_aSet theory.
650		0	_aForcing (Model theory).
655		4	_aElectronic books.
700	1		_aShelah, Saharon.
776	0	8	_iPrint version: _aRosłanowski, Andrzej _tNorms on Possibilities. I _dProvidence : American Mathematical Society,c1999 _z9780821811801
797	2		_aProQuest (Firm)
830		0	_aMemoirs of the American Mathematical Society
856	4	0	_uhttps://ebookcentral.proquest.com/lib/orpp/detail.action?docID=3114493 _zClick to View
999			_c69988 _d69988