(51) We apply 8I to (51) and prove (49). P and t are deened inductively over the structure of sequent trees. In the base case, we have P and t such that (47) is 8x (T(x) T(x)). Consider now the step case. We write (47) in the following form. (52) where P x 1 ; :::; x n ] does not contain occurrences of T. We assume the hypotheses of (52) and derive Tac(x 1) ^ ::: ^ Tac(x m). From (29) we obtain...

We extend the result from Bossert and Sprumont (2013) that every single-valued choice function is backwards-induction rationalizable via strict preferences to the case of choice correspondences via weak preferences. JEL Classification Numbers: C72; D70

We prove a strong induction theorem and classify the tempered and square integrable representations of graded Hecke algebras.

Rbstract In the AI community, there is an ongoing debate as to the most appropriate theory of inferencing under uncertainty. This paper explores the problem of inference from a different perspective. It is suggested that an inferencing system should reflect an inference policy that is tailored to the domain of problems to which it is applied -and furthermore that an inference polic y need not c...

Efim Khalimsky’s digital Jordan curve theorem states that the complement of a Jordan curve in the digital plane equipped with the Khalimsky topology has exactly two connectivity components. We present a new, short proof of this theorem using induction on the Euclidean length of the curve. We also prove that the theorem holds with another topology on the digital plane but then only for a restric...

Controlled K-theory is used to show that algebraic K-theory of virtually abelian groups is described by an assembly map defined using possibly-infinite hyperelementary subgroups. The Farrell-Jones summand (coming from infinite subgroups) is parameterized by the rational projective space of the group.

We study projective non-degenerate closed subschemes X ⊆ P having degenerate general hyperplane section, continuing our earlier work. We find inequalities involving three relevant integers, namely: the dimensions of the spans of Xred and of the general hyperplane section of X, and a measure of the “fatness” of X, which is introduced in this paper. We prove our results first for curves and then ...

Stackelberg-like games show a situation where there is a clear advantage in moving …rst. In a thought provoking article, Bagwell (1995) shows that this advantage may not be robust against imperfect observations of the …rst move. We explore these ideas in the context of forward induction in three classic games, namely, the outside option game, the game of burning a dollar before the battle of th...

MODELS OF TRANSFINITE REDUCTIONS

All equilibrium concepts implicitly make a correct beliefs assumption, stating that a player believes that his opponents are correct about his first-order beliefs. In this paper we show that in many dynamic games of interest, this correct beliefs assumption may be incompatible with a very basic form of forward induction reasoning: the first two layers of extensive-form rationalizability (Pearce...