BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Philosophy events - ECPv6.16.3//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Philosophy events
X-ORIGINAL-URL:/philevents
X-WR-CALDESC:Events for Philosophy events
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:20250330T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:20251026T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:20260329T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:20261025T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:20270328T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:20271031T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/London:20260513T150000
DTEND;TZID=Europe/London:20260513T170000
DTSTAMP:20260611T221450
CREATED:20260220T075400Z
LAST-MODIFIED:20260503T175321Z
UID:10002736-1778684400-1778691600@www.st-andrews.ac.uk
SUMMARY:Metaphysics & Logic Seminar
DESCRIPTION:
URL:/philevents/event/metaphysics-logic-seminar-17/
LOCATION:Edgecliffe G03
CATEGORIES:Metaphysics and Logic group
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/London:20260513T150000
DTEND;TZID=Europe/London:20260513T170000
DTSTAMP:20260611T221450
CREATED:20260504T175326Z
LAST-MODIFIED:20260513T190825Z
UID:10002889-1778684400-1778691600@www.st-andrews.ac.uk
SUMMARY:Metaphysics & Logic Seminar: Greg Restall\, “The Logic of Paradox as a Substructural Logic”
DESCRIPTION:Graham Priest’s simple three-valued logic LP has many curious properties. It has the same valid formulas as classical logic\, but differs from classical logic when it comes to valid sequents. The valid sequents do not uniquely characterise the logic: it is possible to have more than one different LP-“negation”\, each of which satisfies all the LP-requirements\, without being equivalent. (The situation is not unlike modal operators in your favoured modal logic. A modal logic like S5 does not uniquely determine the meaning of the modal operators. The same goes for LP when characterised in terms of its consequence relation.)\n\n\n\nOne consequence of this fact is that extant proof-first characterisations of LP are unwieldy. In some systems\, connectives are given rules featuring negation and rules without; in others\, formulas occur positively or negatively signed\, and in others\, sequents have three positions in which formulas can occur instead of two. This makes relating LP to familiar logics on a proof-first basis difficult. \nThe simple three-valued logic ST (strict-tolerant logic) also has many curious properties. It has the same valid formulas and valid sequents as classical logic\, but differs from classical logic at the level of meta-inferential validity (rules obtaining between sequents). In ST\, the Cut rule is not generally valid: from A ⇒ B and B ⇒ C\, it need not follow that A ⇒ C. Understanding the distinctive behaviour of ST on an inferential level involves considering not only valid formulas and valid inferences but also valid meta-inferences. However\, keeping track of this ever-growing tower of consequence relations is also difficult. \nIn this talk\, I aim to address both of these issues in one go. I will exploit the relationship between LP and ST\, and some prior work on mildly bilateral treatments of natural deduction to provide a novel natural deduction proof system for both LP and ST that has the following features: \n\nEach connective rule is a standard natural deduction rule\, familiar from Gentzen.\nEach connective is uniquely characterised by rules governing it.\nThe difference between LP and ST on the one hand\, and classical logic on the other\, is the addition of a purely structural rule.\nThe relationship between the valid formulas\, the valid sequents\, and the valid meta-sequents in each of the logics in question (LP\, ST and classical logic) is uniquely and systematically determined by the rules governing the construction of proofs in the underlying calculus.\n\nThe aim of this exercise is not is to not only get a better understanding the breadth of the range of options for inferential presentations of logic LP and ST\, but to also deepen our understanding of the relationship between natural deduction and the sequent calculus (and meta-inferential relations above the level of the sequent)\, and the distinctive role of structural rules from each of these perspectives.
URL:/philevents/event/metaphysics-logic-seminar-greg-restall-the-logic-of-paradox-as-a-substructural-logic/
LOCATION:Edgecliffe G03
CATEGORIES:Metaphysics and Logic group
END:VEVENT
END:VCALENDAR