Hi everyone,

The Computer Science Colloquium scheduled for tomorrow, May 5th, has been postponed to next Thursday, May 12th.

Regards,

Jonas Reitz

This Week in Logic at CUNY:

– – – – Monday, May 2, 2011 – – – –

– – – – Tuesday, May 3, 2011 – – – –

– – – – Wednesday, May 04, 2011 – – – –

Models of Peano Arithmetic

Wednesday, May 4, 2011 4:00 pm Math Thesis Room (Room 4214-03) Mr. Whanki Lee (CUNY Graduate Center)

Large resplendent model generated by indiscernibles (Part III)

Abstract. In 1989, James Schmerl proved that every countable recursively saturated structure M with the capability to code finite functions has an indiscernible type that can produce arbitrarily large structures N such that N equiv_{infty,omega} M. The proof in his paper is rather sketchy. We will follow his argument while filling the gaps.

– – – – Thursday, May 05, 2011 – – – –

– – – – Friday, May 06, 2011 – – – –

Set Theory Seminar

Friday, May 6, 2011 10:00 am GC 6417

Professor Gunter Fuchs (The City University of New York)

An application of almost disjoint coding

Model Theory Seminar

Friday, May 6, 2011 12:30 pm GC 6417

Dr. Andrew Parker (BMCC and Baruch College)

Quantifier elimination for modules

Abstract. It is a classical result from the 70’s that in modules every formula is equivalent to a boolean combination of so-called positive primitive formulas. Ziegler’s elegant proof from his seminal 1984 paper will be presented.

Logic Workshop

Friday, May 6, 2011 2:00 pm GC 6417

Professor Alexey Ovchinnikov (City University of New York, Queens College) Bounds for orders of derivatives in differential elimination algorithms

Abstract. Differential elimination algorithms simplify systems of polynomial ordinary and partial differential equations. We will discuss how one can bound the number of differentiations these algorithms make and the orders of derivatives in the output. The goal is to further understand the computational complexity of such algorithms.

Logic and Games Seminar

Friday, May 6, 2011 4:15 pm GC, Room 4419

Navin Kartik (Economics Department, Columbia University)

Implementation with Evidence

Abstract: We generalize the canonical problem of Nash implementation (Maskin, 1977) by allowing agents to voluntarily provide

discriminatory signals, i.e. evidence. Evidence can either take the form of hard information or, more generally, have differential but non-prohibitive costs in different states. In such environments, social choice functions that are not Maskin-monotonic can be implemented. We formulate a more general property,

evidence-monotonicity, and show that this is a necessary condition for implementation. Evidence-monotonicity is also sufficient for implementation in a large domain. In some settings, such as when agents have small preferences for honesty, any social choice function is evidence-monotonic. Additional characterizations are obtained for hard evidence.

Next Week in Logic at CUNY:

– – – – Monday, May 9, 2011 – – – –

– – – – Tuesday, May 10, 2011 – – – –

– – – – Wednesday, May 11, 2011 – – – –

– – – – Thursday, May 12, 2011 – – – –

The Computer Science Colloquium

Thursday, May 12th, 4:15pm, room 9204/05

Rohit Parikh (Brooklyn College & CUNY Graduate Center)

Knowledge, Common Knowledge, and Games

– – – – Friday, May 13, 2011 – – – –

Model Theory Seminar

Friday, May 13, 2011 12:30 pm GC 6417

Professor Philipp Rothmaler (The City University of New York, BCC) The Ziegler spectrum – an invitation to the model theory of modules

Abstract. A breakthrough in the model theory of modules with many important implications for and applications to the algebraic theory, especially to the representation theory of associative algebras, was achieved by Ziegler’s introduction of a topological space whose points are the indecomposable pure-injective (= algebraically compact = pp-saturated) R-modules and whose topology is given by positive primitive formulas in the first-order language of R-modules. The paradigm in the field ever since has been, once you know the Ziegler spectrum of R, you more or less know the entire category of R-modules.

I will introduce this crucial object of study, give examples, and explain its role in the field, both on the algebraic and on the model-theoretic sides.

Note the (almost invisible) link to the original paper below.

Logic Workshop

Friday, May 13, 2011 2:00 pm GC 6417

Professor David Marker (University of Illinois at Chicago) Absoluteness in Model Theory

Abstract. In his book “Saturated Model Theory” Sacks points out that many of the fundamental concepts of model theory, though appearing to rely on set theoretic concepts, are absolute. I will survey some of the known results on the complexity of notions from model theory of first order logic and $L_{omega_1,omega}$.

Logic and Games Seminar

Friday, May 13, 2011 4:15 pm GC, Room 4419

Branden Fitelson (Philosophy – Rutgers University)

– – – – Other Logic News – – – –

– – – – Web Site – – – –

The majority of this information, including an interactive calendar of future events, can be found at our website: