BEGIN:VCALENDAR
PRODID:-//Grails iCalendar plugin//NONSGML Grails iCalendar plugin//EN
VERSION:2.0
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VEVENT
DTSTAMP:20260928T225735Z
DTSTART;TZID=Australia/Melbourne:20130315T110000
DTEND;TZID=Australia/Melbourne:20130315T123000
SUMMARY:Aristotle-Fine Logic
UID:20260929T195101Z-iCalPlugin-Grails@fe80:0:0:0:c469:93ff:feda:b6b0%3
TZID:Australia/Melbourne
LOCATION:University of Melbourne\, Parkville\, Australia\, 3010
DESCRIPTION:<p>In "Aristotle's Megarian Maneuvers" (forthcoming in Mind)\,<br>Kit Fine argues that Aristotle's propositional modal logic should be<br>identified with the logic he calls KP2D\, where K and D are what you<br>expect\, and P2 is (p &amp\; -q)  (p &amp\; -q). He shows\, among many<br>other things\, that KP2D is (1) reductive (any nested occurrence of a<br>modality is equivalent to a non-nested one)\, and (2) strongly<br>anti-Megarean (any consistent non-modal formula constitutes a genuine<br>possibility). In an earlier draft of the article\, Fine stated that<br>there were precisely two normal logics having the properties above\,<br>namely\, S5 and his Aristotelian system. I pointed out in an email<br>conversation that because of a subtlety involving D in fact there were<br>four. (To my grateful surprise\, Fine gives me credit for this little<br>observation.) So\, we have:<br><br>Theorem. There are precisely 4 reductive and strongly anti-Megarean<br>normal modal logics: S5\, S5 x Ver\, KP2D\, KP2 (= KP2D x Ver). &nbsp\;&nbsp\;<br><br>I will sketch a proof and\, time permitting\, say something more on the<br>similarities between S5 (S5 x Ver) and KP2D (KP2).</p>
ORGANIZER:
METHOD:PUBLISH
END:VEVENT
END:VCALENDAR
