PlumX Metrics
Embed PlumX Metrics

PROOF ANALYSIS for LEWIS COUNTERFACTUALS

Review of Symbolic Logic, ISSN: 1755-0211, Vol: 9, Issue: 1, Page: 44-75
2016
  • 12
    Citations
  • 0
    Usage
  • 5
    Captures
  • 0
    Mentions
  • 0
    Social Media
Metric Options:   Counts1 Year3 Year

Metrics Details

  • Citations
    12
    • Citation Indexes
      12
  • Captures
    5

Article Description

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.

Provide Feedback

Have ideas for a new metric? Would you like to see something else here?Let us know