E. A. Emerson and C. S. Jutla, Tree Automata, Mu-Calculus, and Determinacy.

... have somewhat simplied the proofs over Ra69], the proofs are far from being transparent. Moreover, their proofs of Theorem (1) and (2) are intertwined. The new proof of the Complementation Lemma via MuCalculus suggests the following for simplifying the above approach, i.e. (1) and (2), as well: To ...

... have somewhat simplied the proofs over Ra69], the proofs are far from being transparent. Moreover, their proofs of Theorem (1) and (2) are intertwined. The new proof of the Complementation Lemma via MuCalculus suggests the following for simplifying the above approach, i.e. (1) and (2), as well: To ...

The Perfect Set Theorem and Definable Wellorderings of the

... ?2. The main result. A classical theorem of G6del asserts that if every real is constructible (i.e. V = L holds for reals) then there is a 127 wellordering of S. Recently, Mansfield [6] proved the converse of this theorem. In attempting, as it is fashionable these days, to find an appropriate genera ...

... ?2. The main result. A classical theorem of G6del asserts that if every real is constructible (i.e. V = L holds for reals) then there is a 127 wellordering of S. Recently, Mansfield [6] proved the converse of this theorem. In attempting, as it is fashionable these days, to find an appropriate genera ...

CARLOS AUGUSTO DI PRISCO The notion of infinite appears in

... The construction of the model M [g] and the proof that it has the desired properties is quite elaborate. Certain elements of the model M are used as “names” for elements of M [g]. Which set is the object named by a name τ depends on the generic g, and given g, the model M [g] is the collection of se ...

... The construction of the model M [g] and the proof that it has the desired properties is quite elaborate. Certain elements of the model M are used as “names” for elements of M [g]. Which set is the object named by a name τ depends on the generic g, and given g, the model M [g] is the collection of se ...

Lecture 4 (EF Games and First-order Definability)

... sentences if m ≥ 2k . We do this by showing that player 1 has a winning strategy in the k round game defined by these words. The proof proceeds by induction. When k = 0 we have the words ai and ai+1 , i ≥ 1 are clearly indistinguishable by atomic formulas (over the empty set of variables!). Let us s ...

... sentences if m ≥ 2k . We do this by showing that player 1 has a winning strategy in the k round game defined by these words. The proof proceeds by induction. When k = 0 we have the words ai and ai+1 , i ≥ 1 are clearly indistinguishable by atomic formulas (over the empty set of variables!). Let us s ...

The 12th Delfino Problem and universally Baire sets of reals

... the existence of a model with one Woodin cardinal. But below one Woodin cardinal δ there are inaccessibly many δ-strong cardinals, so in particular countably many. If the #12 hypothesis would yield a model of projective determinacy, we had arrived at contradiction to Gödel’s incompleteness theorem. ...

... the existence of a model with one Woodin cardinal. But below one Woodin cardinal δ there are inaccessibly many δ-strong cardinals, so in particular countably many. If the #12 hypothesis would yield a model of projective determinacy, we had arrived at contradiction to Gödel’s incompleteness theorem. ...

Infinite Games - International Mathematical Union

... strategy for the other. T* is much bigger than T: if T has size 3fy, then T7* has size roughly mß+a. Individual moves in G* represent complex commitments as to how the players will move in an associated play of G. Results of Friedman [2] showed that, even for r=Seq, some kind of appeal to uncountabl ...

... strategy for the other. T* is much bigger than T: if T has size 3fy, then T7* has size roughly mß+a. Individual moves in G* represent complex commitments as to how the players will move in an associated play of G. Results of Friedman [2] showed that, even for r=Seq, some kind of appeal to uncountabl ...