A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Standard Sequent Calculi for Lewis' Logics of Counterfactuals
[chapter]
2016
Lecture Notes in Computer Science
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
doi:10.1007/978-3-319-48758-8_18
fatcat:grbbjbw6xfh7dhf7ma46drr4ke