Rybakov proved that the admissible rules of $\mathsf {IPC}$ are decidable. We give a proof of the same theorem, using the same core idea, but couched in the many notions that have been developed in the mean time. In particular, we illustrate how the argument can be interpreted as using refinements of the notions of exactness and extendibility.

Philosophical issues often turn into logic. That is certainly true of Moore’s Paradox, which tends to appear and reappear in many philosophical contexts. There is no doubt that its study belongs to pragmatics rather than semantics or syntax. But it is also true that issues in pragmatics can often be studied fruitfully by attending to their projection, so to speak, onto the levels of semantics or syntax — just in the way that problems in spherical geometry are often illuminated by (...) the study of projections onto a plane. To begin I will describe a potentially vast landscape of logics of a certain form, with some illustrations of how they appear naturally in response to some problems in philosophical logic. Then I will turn Moore’s Paradox into logic, within that landscape, and show how far it can be illuminated therein. (shrink)

If a certain semantic relation (which we call 'local consequence') is allowed to guide expectations about which rules are derivable from other rules, these expectations will not always be fulfilled, as we illustrate. An alternative semantic criterion (based on a relation we call 'global consequence'), suggested by work of J.W. Garson, turns out to provide a much better - indeed a perfectly accurate - guide to derivability.

The interplay of introduction and elimination rules for propositional connectives is often seen as suggesting a distinguished role for intuitionistic logic. We prove three formal results concerning intuitionistic propositional logic that bear on that perspective, and discuss their significance. First, for a range of connectives including both negation and the falsum, there are no classically or intuitionistically correct introduction rules. Second, irrespective of the choice of negation or the falsum as a primitive connective, classical and intuitionistic consequence satisfy exactly the (...) same structural, introduction, and elimination (briefly, elementary) rules. Third, for falsum as primitive only, intuitionistic consequence is the least consequence relation that satisfies all classically correct elementary rules. (shrink)