Abstract not found

sets, Rigid graphs, Universal graphs. The authors wish to thank the Mittag-Leffler Institute, for its

Girardi of New York-Presbyterian Hospital. Without them I would not be around to

Abstract not found

We discuss infinite zero-sum perfect-information games with more than two players. They are not determined in the traditional sense, but as soon as you fix a preference function for the players and assume common knowledge of rationality and this preference function among the players, you get determinacy for open and closed payo# sets.

Abstract. In this paper, we give a thorough and basic introduction to the main techniques dealing with computation of cardinals under the Axiom of Determinacy by measure analyses. As an application, we give a simple inductive measure analysis (without invoking Jackson’s “description theory”) that allows the computation of further Jónsson cardinals. The Axiom of Determinacy AD is a game-theoretic statement expressing that all infinite two-player perfect information games with a countable set of possible moves are determined, i.e., admit a winning strategy for one of the players. The restriction to countable sets of possible moves makes AD essentially a statement about real numbers and sets of real numbers, and traditionally it has been investigated by descriptive set theorists. As a consequence, it comes as a surprise to see that AD has strikingly peculiar consequences for the combinatorics on uncountable cardinals such as ℵω: for example, the Axiom of Determinacy implies that every algebra on ℵω has a proper subalgebra of cardinality ℵω. How can an axiom that talks about the existence of

motivated by games used in statistics. It is known that

We prove that for all standard arboreal forcing notions P there is a counterexample for the implication "If A is determined, then A is P-measurable". Moreover, we investigate for which forcing notions this is extendible to "weakly P-measurable".

the constructible universe L, established the relative consistency of the Axiom of Choice and the Continuum Hypothesis. More broadly, he secured the cumulative hierarchy view of the universe of sets and ensured the ascendancy of first-order logic as the framework for set theory. Gödel thereby transformed set theory and launched it with structured subject matter and specific methods of proof as a distinctive field of mathematics. What follows is a survey of prior developments in set theory and logic intended to set the stage, an account of how Gödel marshaled the ideas and constructions to formulate L and establish his results, and a description of subsequent developments in set theory that resonated with his speculations. The survey trots out in quick succession the groundbreaking work at the beginning of a young subject. Numbers, Types, and Well-Ordering Set theory was born on that day in December 1873 when Georg Cantor (1845–1918) established that the continuum is not countable: There is no bijection between the natural numbers N ={0, 1, 2, 3,...} and the real numbers R, since for any (countable) sequence of reals one can specify nested intervals so that any real in the intersection will not be in the sequence. Cantor soon investigated ways to define bijections between sets

Abstract. Given a space 〈X, J 〉 in an elementary submodel M of H(θ), define XM to be X ∩ M with the topology generated by {U ∩ M: U ∈ J ∩ M}. It is established, using anti-large-cardinals assumptions, that if XM is compact and its regular open algebra is isomorphic to that of a continuous image of some power of the two-point discrete space, then X = XM. Assuming CH+SCH (the Singular Cardinals Hypothesis) in addition, the result holds for any compact XM satisfying the countable chain condition. 1.