May 2, 20121:03:41pending
Sequent Systems and Defining Rules
About this episode
Greg Restall (Melbourne) gives a talk at the MCMP Colloquium (12 Apr, 2012) titled "Sequent Systems and Defining Rules". Abstract: In this talk I will explain how it can be that inference rules can be used to define a class of concepts, and why there are at least three grades of logical complexity (propositional connectives, quantifiers, and modals), depending on the kinds of discourse features exploited in those rules. I'll then explain how concepts characterised by "defining rules" (which I’ll precisely characterise) have a number of important features, such as admitting a uniform cut elimination argument.
Get every episode summarized
Each time MCMP – Mathematical Philosophy (Archive 2011/12) publishes, we email you a written briefing from the transcript — the topics, who appeared, and any specific claims, with the ad reads skipped.
Email me new episodesFree for 3 shows. No card needed.
Hosts & guests
No transcript yet
This episode has not been transcribed. Request it and it moves to the front of the queue.
More episodes
More from MCMP – Mathematical Philosophy (Archive 2011/12)
Modality and Categories
MCMP – Mathematical Philosophy (Archive 2011/12)
Apr 22, 20191:01:52pending
Adaptive Logics: Introduction, Applications, Computational Aspects and Recent De...
MCMP – Mathematical Philosophy (Archive 2011/12)
Apr 22, 20191:18:33pending
Belief Dynamics under Iterated Revision: Cycles, Fixed Points and Truth-tracking
MCMP – Mathematical Philosophy (Archive 2011/12)
Apr 20, 20191:19:40pending
Tracking the Truth Requires a Non-wellfounded Prior!
MCMP – Mathematical Philosophy (Archive 2011/12)
Apr 20, 20191:31:54pending