Standard Sequent Calculi for Lewis' Logics of Counterfactuals

We present new sequent calculi for Lewis’ logics of counterfactuals. The calculi are based on Lewis’ connective of comparative plausibility and modularly capture almost all logics of Lewis’ family. Our calculi are standard, in the sense that each connective is handled by a finite number of rules with a fixed and finite number of premises; internal, meaning that a sequent denotes a formula in the language, and analytical. We present two equivalent versions of the calculi: in the first one, the calculi comprise simple rules; we show that for the basic case of logic V, the calculus allows for syntactic cut-elimination, a fundamental proof-theoretical property. In the second version, the calculi comprise invertible rules, they allow for terminating proof search and semantical completeness. We finally show that our calculi can simulate the only internal (non-standard) sequent calculi previously known for these logics.