BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//UM//UM*Events//EN
CALSCALE:GREGORIAN
BEGIN:VTIMEZONE
TZID:America/Detroit
TZURL:http://tzurl.org/zoneinfo/America/Detroit
X-LIC-LOCATION:America/Detroit
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20070311T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20071104T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20240903T161138
DTSTART;TZID=America/Detroit:20241007T130000
DTEND;TZID=America/Detroit:20241007T140000
SUMMARY:Workshop / Seminar:Science Success Series- Mindful Mondays
DESCRIPTION:Give your brain some rejuvenation by taking a mindful study break. Come join us for an hour of connection\, conversation\, and crafts with fellow students. The WISE Mentors will be available to answer any questions you may have. Need a resume review\, advice for picking classes\, help making a study schedule? We've got you covered! \n\nThis is a drop-in style event where you can come and go as your schedule allows. Light snacks will be provided.
UID:124494-21853099@events.umich.edu
URL:https://events.umich.edu/event/124494
CLASS:PUBLIC
STATUS:CONFIRMED
CATEGORIES:Sessions
LOCATION:Chemistry Building, Science Learning Center Flex Space
CONTACT:
END:VEVENT
BEGIN:VEVENT
DTSTAMP:20241004T123644
DTSTART;TZID=America/Detroit:20241007T130000
DTEND;TZID=America/Detroit:20241007T140000
SUMMARY:Lecture / Discussion:Student Logic and History of Math Seminar (Invited Address): Provability Logic
DESCRIPTION:Provability logic seeks to efficiently describe\, by suitable axioms and rules of inference\, what a reasonable theory can prove about its own provability predicate. Here “reasonable” means that the theory can prove basic facts about the natural numbers\; Peano arithmetic is more than enough.\n\nThe notation used in provability logic (meaning in the particular provability logic that I’ll concentrate on) is the same as in most modal logics\, namely ordinary propositional logic plus a modal operator\, written as a box. But the box operator has the unusual interpretation “it is provable that”. It turns out that this provability logic can be axiomatized by adding to ordinary propositional logic just one axiom (schema) and one inference rule. The rule is very simple\, but the axiom expresses Löb’s theorem\, a far from obvious fact about provability.\n\nI’ll begin by explaining Löb’s theorem. Then I’ll discuss the axiomatic system of provability logic and a few proofs in that system. Next\, I’ll describe the Kripke models of provability logic. Finally\, I’ll discuss two completeness theorems for this logic\, one saying that Kripke models provide a complete semantics\, and the other saying that provability logic exactly captures what a reasonable theory can prove about its own provability.
UID:126576-21857352@events.umich.edu
URL:https://events.umich.edu/event/126576
CLASS:PUBLIC
STATUS:CONFIRMED
CATEGORIES:Graduate Students,Mathematics,seminar,Talk,Undergraduate Students
LOCATION:East Hall - 3866
CONTACT:
END:VEVENT
END:VCALENDAR