BEGIN:VCALENDAR
PRODID:-//PSU Mathematics Department//Seminar iCalendar Generator//EN
VERSION:2.0
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Logic Seminar
X-WR-TIMEZONE:America/New_York
BEGIN:VTIMEZONE
TZID:America/New_York
X-LIC-LOCATION:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20160105T143000
DTEND;TZID=America/New_York:20160105T154500
LOCATION:MB315
URL:http://www.math.psu.edu/seminars/meeting.php?id=29279
SUMMARY:Logic Seminar - TBA
DESCRIPTION:Seminar: Logic Seminar\nTitle: TBA\nAbstract Link: http://
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20160112T143000
DTEND;TZID=America/New_York:20160112T154500
LOCATION:MB315
URL:http://www.math.psu.edu/seminars/meeting.php?id=29280
SUMMARY:Logic Seminar - Planning Meeting
DESCRIPTION:Seminar: Logic Seminar\nTitle: Planning Meeting\nAbstract: Meet
ing to plan the logic seminar for the semester.
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20160119T143000
DTEND;TZID=America/New_York:20160119T154500
LOCATION:MB315
URL:http://www.math.psu.edu/seminars/meeting.php?id=29281
SUMMARY:Logic Seminar - TBA
DESCRIPTION:Seminar: Logic Seminar\nTitle: TBA\nAbstract Link: http://
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20160126T143000
DTEND;TZID=America/New_York:20160126T154500
LOCATION:MB315
URL:http://www.math.psu.edu/seminars/meeting.php?id=29282
SUMMARY:Logic Seminar - The reverse mathematics of Ramsey's Theorem
DESCRIPTION:Seminar: Logic Seminar\nTitle: The reverse mathematics of Ramse
y's Theorem\nSpeaker: Stephen G. Simpson\, Pennsylvania State University\n
Abstract: Questions about the reverse-mathematical status of Ramsey's Theo
rem have been of great interest for more than 40 years. I will begin with
a brief survey of known results. After that\, I will discuss a very rece
nt result due to Ludovic Patey and Keita Yokoyama: WKL_0 + RT(2\,2) is con
servative over RCA_0 for sentences of the form (forall X) A(X) where A is
a Pi^0_3 formula.
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20160202T143000
DTEND;TZID=America/New_York:20160202T154500
LOCATION:MB315
URL:http://www.math.psu.edu/seminars/meeting.php?id=29283
SUMMARY:Logic Seminar - Fine Structure and Algorithmic Randomness
DESCRIPTION:Seminar: Logic Seminar\nTitle: Fine Structure and Algorithmic R
andomness\nSpeaker: Jan Reimann\, Penn State\nAbstract: Jensen's fine stru
cture theory allows for a canonical definition of codes for levels of Goed
el's constructible universe similar to how the Turing jump codes levels of
the arithmetic hierarchy. \n\nIn this talk\, we will show how Jensen's co
des and algorithmic randomness behave mutually orthogonal. This allows us
in turn to derive a metamathematical result about randomness with respect
to continuous measures.
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20160216T143000
DTEND;TZID=America/New_York:20160216T154500
LOCATION:MB315
URL:http://www.math.psu.edu/seminars/meeting.php?id=29285
SUMMARY:Logic Seminar - Fine Structure Theory and Algorithmic Randomness (I
I)
DESCRIPTION:Seminar: Logic Seminar\nTitle: Fine Structure Theory and Algori
thmic Randomness (II)\nSpeaker: Jan Reimann\, Penn State\nAbstract: Jensen
's fine structure theory allows for a canonical definition of codes for le
vels of Goedel's constructible universe similar to how the Turing jump cod
es levels of the arithmetic hierarchy. In this talk\, we will show how Jen
sen's codes and algorithmic randomness behave mutually orthogonal. This al
lows us in turn to derive a metamathematical result about randomness with
respect to continuous measures.
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20160223T143000
DTEND;TZID=America/New_York:20160223T154500
LOCATION:MB315
URL:http://www.math.psu.edu/seminars/meeting.php?id=29286
SUMMARY:Logic Seminar - Gambling Against Even More Odds\, Part 1
DESCRIPTION:Seminar: Logic Seminar\nTitle: Gambling Against Even More Odds
\, Part 1\nSpeaker: John Pardo\, Penn State\nAbstract: Following the work
of Bavly and Peretz\, I will continue my discussion from past talks regard
ing recent results of mine in the area of restricted value martingales. I
n particular\, I will partially answer an earlier conjecture as well as gi
ve an idea of how to complete the result.
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20160301T143000
DTEND;TZID=America/New_York:20160301T154500
LOCATION:MB315
URL:http://www.math.psu.edu/seminars/meeting.php?id=29287
SUMMARY:Logic Seminar - TBA
DESCRIPTION:Seminar: Logic Seminar\nTitle: TBA\nSpeaker: John Pardo\, Penn
State
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20160308T143000
DTEND;TZID=America/New_York:20160308T154500
LOCATION:MB315
URL:http://www.math.psu.edu/seminars/meeting.php?id=29288
SUMMARY:Logic Seminar - No seminar\, Spring Break
DESCRIPTION:Seminar: Logic Seminar\nTitle: No seminar\, Spring Break
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20160315T143000
DTEND;TZID=America/New_York:20160315T154500
LOCATION:MB315
URL:http://www.math.psu.edu/seminars/meeting.php?id=29289
SUMMARY:Logic Seminar - No Seminar
DESCRIPTION:Seminar: Logic Seminar\nTitle: No Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20160322T143000
DTEND;TZID=America/New_York:20160322T154500
LOCATION:MB315
URL:http://www.math.psu.edu/seminars/meeting.php?id=29290
SUMMARY:Logic Seminar - Potential Cardinality for Countable First Order The
ories
DESCRIPTION:Seminar: Logic Seminar\nTitle: Potential Cardinality for Counta
ble First Order Theories\nSpeaker: Richard Rast\, University of Maryland\n
Abstract: Give a theory $T$\, understanding the countable model theory of
$T$ has long been a topic of research. The number of countable models of
$T$ is a classical but very coarse invariant\, and this was refined signif
icantly by Friedman and Stanley with the notion of Borel reductions.\n\nGi
ven theories $T_1$ and $T_2$\, it is often straightforward to show that $T
_1$ is Borel reducible to $T_2$. However\, there are few tools to show th
at no such Borel reduction exists. Most of the existing tools only work w
hen the isomorphism relation of one or both is particularly simple\, or at
least Borel.\n\nWe define the notion of ``potential cardinality'' of $T$
\, denoted $\\|T\\|$\, as the number of formally consistent\, possibly unc
ountable Scott sentences which imply $T$. It turns out that if $T_1$ Bore
l reduces to $T_2$\, then $\\|T_1\\|\\leq \\|T_2\\|$. Additionally\, it t
urns out that very frequently\, $\\|T\\|$ can be computed and is not a pro
per class.\n\nWe use this idea to give a new class of examples of first-or
der theories whose isomorphism relations are neither Borel nor Borel compl
ete. Along the way we answer an old question of Koerwien and new question
of Laskowski and Shelah.\n\nThis is joint work with Douglas Ulrich and Ch
ris Laskowski.
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20160329T143000
DTEND;TZID=America/New_York:20160329T154500
LOCATION:MB315
URL:http://www.math.psu.edu/seminars/meeting.php?id=29291
SUMMARY:Logic Seminar - TBA
DESCRIPTION:Seminar: Logic Seminar\nTitle: TBA\nSpeaker: TBA
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20160405T143000
DTEND;TZID=America/New_York:20160405T154500
LOCATION:MB315
URL:http://www.math.psu.edu/seminars/meeting.php?id=29292
SUMMARY:Logic Seminar - CLT-normal sequences
DESCRIPTION:Seminar: Logic Seminar\nTitle: CLT-normal sequences\nSpeaker: M
anfred Denker\, Penn State\nAbstract: Let x(1)\,x(2)\,... be a sequence of
zeros and ones. It may be called CLT-normal (analogously to the usual ter
minology of normal points) if the limit of the sequence\n\n 1/log M \\s
um_{N=1}^M [ 1_{2x(1)-1 < 2t} + 1/2 1_{2(x(1)+x(2))-2 < 2 sqrt(2) t}+...
+ 1/N 1_{2(x(1)+...+x(N))-N< 2sqrt(N) t}]\n\nconverges for every real numb
er t and the limit is given by the standard Gaussian measure of the interv
al of reals