BEGIN:VCALENDAR
PRODID:-//Grails iCalendar plugin//NONSGML Grails iCalendar plugin//EN
VERSION:2.0
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VEVENT
DTSTAMP:20260930T160452Z
DTSTART;TZID=Australia/Melbourne:20190913T070000
DTEND;TZID=Australia/Melbourne:20190913T090000
SUMMARY:How Much Propositional Logic Suffices for Rosser’s Essential Undecidability Theorem?
UID:20261005T103129Z-iCalPlugin-Grails@fe80:0:0:0:ac83:5bff:fea0:108%3
TZID:Australia/Melbourne
LOCATION:Old Arts\, Parkville\, Australia\, 3010
DESCRIPTION:<p>Guillerm Badia (UQ) will present "How Much Propositional Logic Suffices for Rosser&rsquo\;s Essential Undecidability&nbsp\;Theorem?" at 11 in Old Arts 224 on 13 September.&nbsp\;</p>\n<p>Abstract:&nbsp\;In this talk we explore the following question: how weak can a logic be for Rosser&rsquo\;s essential&nbsp\;undecidability &nbsp\;to be provable for a weak arithmetic theory? We establish that extending&nbsp\;the &nbsp\;relevant logic B with weakening (in a language including falsum) is enough.&nbsp\;Our work&nbsp\;improves on previous results in the literature by Petr H&aacute\;jek concerning certain fuzzy logics.&nbsp\;Hence\, Rosser&rsquo\;s argument&nbsp\;is seen to go well beyond the scope of the simple Boolean\, intuitionistic\, or fuzzy case. Our target arithmetical&nbsp\;theories are weaker than Robinson&rsquo\;s R and Q but still expressive enough for essential undecidability. &nbsp\;(Joint work with Petr Cintula and Andrew Tedder)</p>\n
ORGANIZER;CN=Shawn Standefer:
METHOD:PUBLISH
END:VEVENT
END:VCALENDAR