BEGIN:VCALENDAR
PRODID:-//Grails iCalendar plugin//NONSGML Grails iCalendar plugin//EN
VERSION:2.0
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VEVENT
DTSTAMP:20260604T221009Z
DTSTART;TZID=Australia/Melbourne:20131101T070000
DTEND;TZID=Australia/Melbourne:20131101T130000
SUMMARY:Melbourne Logic Day
UID:20260606T185712Z-iCalPlugin-Grails@philevents-web-bd7db559-gt5qm
TZID:Australia/Melbourne
LOCATION:University of Melbourne\, Parkville\, Australia\, 3010
DESCRIPTION:<p><strong>11am-12noon</strong></p>\n<p>Michał Stronkowski&mdash\;<em>Almost Structural Completeness</em></p>\n<p>The notion of structural completeness for logics/deductive&nbsp\;systems has received considerable attention for many years. A translation to algebra gives: a quasivariety is structurally complete if it is&nbsp\;generated by its free algebras. It appears that many deductive systems&nbsp\;(quasivarieties)\, like S5 or MVn fails structural completeness for a&nbsp\;rather immaterial reason. Therefore the adjusted notion was introduced:almost structural completeness. We investigate almost structural&nbsp\;completeness from an algebraic perspective and obtain a characterization&nbsp\;of this notion for quasivarieties. We also provide examples of modal&nbsp\;logics which are not structurally complete but are almost structurally&nbsp\;complete.</p>\n<p><strong>12:10pm-1:10pm</strong></p>\n<p>Lloyd Humberstone&mdash\;<em>&nbsp\;Prior's OIC Nonconservativity Example Revisited</em></p>\n<p>In his 1964 note\, &ldquo\;Two Additions to Positive Implication\,&rdquo\; A. N. Prior showed that standard axioms governing conjunction yielded a nonconservative extension of the pure implicational intermediate logic\, OIC (&ldquo\;order implicational calculus&rdquo\;)\, of R. A. Bull. Here we seek to illuminate this example by transposing it to the setting of modal logic\, and also\, in a final (&lsquo\;postcript&rsquo\;) section\, to relate it to the propositional logic of what have been called &lsquo\;Hilbert algebras with infimum&rsquo\;.</p>\n<p><strong>2pm-3pm</strong><em></em></p>\n<p>Greg Restall&mdash\;<em>From Defining Rules to Cut Elimination\, and its consequences</em></p>\n<p>I show how a collection of defining rules (invertible rules characterising connectives) can be converted uniformly and systematically (in the presence of the structural rules of Cut and Identity) converted into Left and Right Rules\, in such a way that the conditions under which Cut can be seen as a natural and straightforward consequence. I explain the motivation\, and the upshot for accounts of harmony\, and the use of sequent rules to define logical concepts.</p>\n<p><strong>3:10pm-4:10pm</strong></p>\n<p>Rohan French&mdash\;<em>Predicate Logic with Scopes</em></p>\n<p>We present a sequent calculus for a novel reformulation of classical predicate logic in which variables play not only an &lsquo\;object representing&rsquo\; role\, but also a &lsquo\;scope indicating&rsquo\; role. Using this sequent calculus we then present some applications to problems in the philosophy of language concerning opaque contexts and propositional attitudes.&nbsp\;</p>\n
ORGANIZER;CN=Greg Restall:
METHOD:PUBLISH
END:VEVENT
END:VCALENDAR