Skip to main content Accesibility Help



A deductive system for Lewis counterfactuals is presented, based directly on the influential generalisation of relational semantics through ternary similarity relations introduced by Lewis. This deductive system builds on a method of enriching the syntax of sequent calculus by labels for possible worlds. The resulting labelled sequent calculus is shown to be equivalent to the axiomatic system VC of Lewis. It is further shown to have the structural properties that are needed for an analytic proof system that supports root-first proof search. Completeness of the calculus is proved in a direct way, such that for any given sequent either a formal derivation or a countermodel is provided; it is also shown how finite countermodels for unprovable sequents can be extracted from failed proof search, by which the completeness proof turns into a proof of decidability.

Corresponding author
Hide All
Blackburn, P. (2000). Internalizing labelled deduction. Journal of Logic and Computation, 10, 137168.
Blackburn, P., Bolander, T., Braüner, T., & Frovin Jørgensen, K. (2015). Completeness and termination for a Seligman-style tableau system. Journal of Logic and Computation. To appear.
Chellas, B. F. (1975). Basic conditional logic. Journal of Philosophical Logic, 4, 133153.
Chisholm, R. (1946). The contrary-to-fact conditional. Mind, 55, 289307.
Dyckhoff, R. & Negri, S. (2012). Proof analysis in intermediate logics. Archive for Mathematical Logic, 51, 7192, 2012.
Dyckhoff, R. & Negri, S. (2013). A cut-free sequent system for Grzegorczyk logic with an application to the Gödel-McKinsey-Tarski embedding. Journal of Logic and Computation, doi 10.1093/logcom/ext036.
Dyckhoff, R. & Negri, S. (2015). Geometrization of first-order logic. The Bulletin of Symbolic Logic, 21, 123163.
Fitting, M. (2007). Modal proof theory. In Blackburn, P., Van Benthem, J., and Wolter, F., editors. Handbook of Modal Logic, pp. 85138, New York: Elsevier.
Gabbay, D. M. & Governatori, G. (1998). Dealing with label dependent deontic modalities. In McNamara, P. and Prakken, H., editors. Norms, Logics and Information Systems, Amsterdam: IOS Press.
Garg, D., Genovese, V. & Negri, S. (2012). Countermodels from sequent calculi in multi-modal logics. LICS 2012, IEEE Computer Society, pp. 315324.
Gasquet, O. & Herzig, A. (1996). From classical to normal modal logics. In Wansing, H., editor. Proof Theory of Modal Logic Applied Logic Series, vol. 2, pp. 293311, New York: Springer.
Gent, I. P. (1992). A sequent- or tableau-style system for Lewis’s counterfactual logic VC. Notre Dame Journal of Formal Logic, 33, 369382.
Giordano, L., Gliozzi, V., Olivetti, N., & Schwind, C. (2008). Tableau calculi for preference-based conditional logics: PCL and its extensions. ACM Transactions on Computational Logic, 10, no. 3/21, 145.
Goodman, N. (1947). The problem of counterfactual conditionals. Journal of Philosophy, 44, 113128.
Hakli, R. & Negri, S. (2012). Does the deduction theorem fail for modal logic? Synthese, 187, 849867.
Kripke, S. (1963). Semantical analysis of modal logic I. Normal modal propositional calculi. Zetschrift für mathematische Logik und Grundlagen der Math., 9, 6796.
Lellman, B. & Pattinson, D. (2012). Sequent systems for Lewis’ conditional logics. In Farinas del Cerro, L., Herzig, A. and Mengin, J., editors. Logics in Artificial Intelligence, pp. 320332.
Lewis, D. (1971). Completeness and decidability of three logics of counterfactual conditionals. Theoria, 37, 7485.
Lewis, D. (1973). Counterfactuals. Oxford: Blackwell.
Lewis, D. (1973a). Counterfactuals and comparative possibility. Journal of Philosophical Logic, 2, pp. 418446, 1973.
Negri, S. (2003). Contraction-free sequent calculi for geometric theories, with an application to Barr’s theorem. Archive for Mathematical Logic, 42, 389401.
Negri, S. (2005). Proof analysis in modal logic. Journal of Philosophical Logic, 34, 507544.
Negri, S. (2009). Kripke completeness revisited. In Primiero, G. and Rahman, S.. editors. Acts of Knowledge - History, Philosophy and Logic, pp. 247282, London: College Publications.
Negri, S. (2014). Proof analysis beyond geometric theories: from rule systems to systems of rules. Journal of Logic and Computation, doi: 10.1093/logcom/exu037.
Negri, S. (2014a). Proofs and countermodels in non-classical logics. Logica Universalis, 8, 2560.
Negri, S. & von Plato, J. (1998). Cut elimination in the presence of axioms. The Bulletin of Symbolic Logic, 4, 418435.
Negri, S. & von Plato, J. (2001). Structural Proof Theory. Cambridge: Cambridge University Press.
Negri, S. & von Plato, J. (2011). Proof Analysis. Cambridge: Cambridge University Press.
Negri, S. & von Plato, J. (2015). Meaning in use. In Wansing, H., editor. Dag Prawitz on Proofs and Meaning, Trends in Logic, Berlin: Springer, 239257.
Olivetti, N., Pozzato, G. L. & Schwind, C. (2007). A Sequent Calculus and a Theorem Prover for Standard Conditional Logics. ACTM Transactions on Computational Logics (TOCL), 8/4, 22/pp. 151.
Priest, G. (2008). An Introduction to Non-Classical Logic, Cambridge: Cambridge University Press.
Read, S. (2015). Semantic pollution and syntactic purity. The Review of Symbolic Logic, doi:
Sano, K. (2009). Hybrid counterfactual logics: David Lewis meets Arthur Prior again. Journal of Logic, Language and Information, 18, 515539.
de Swart, H. C. M. (1983). A Gentzen- or Beth-type system, a practical decision procedure and a constructive completeness proof for the counterfactual logics VC and VCS. The Journal of Symbolic Logic, 48, 120.
Stalnaker, R. (1968). A theory of conditionals. In Rescher, N., editor. Studies in Logical Theory, Oxford, pp. 98112.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Review of Symbolic Logic
  • ISSN: 1755-0203
  • EISSN: 1755-0211
  • URL: /core/journals/review-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed