Skip to main content
SpringerLink
Log in

Sequent Systems for Lewis’ Conditional Logics

  • Conference paper
Logics in Artificial Intelligence (JELIA 2012)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7519))

Included in the following conference series:

Abstract

We present unlabelled cut-free sequent calculi for Lewis’ conditional logic \(\mathbb V\) and extensions, in both the languages with the entrenchment connective and the strong conditional. The calculi give rise to Pspace-decision procedures, also in the language with the weak conditional. Furthermore, they are used to prove the Craig interpolation property for all the logics under consideration, and yield a Pspace-decision procedure for a recently considered hybrid version of \(\mathbb V\).

Supported by EPSRC-Project EP/H016317/1.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Crocco, G., Fariñas del Cerro, L.: Structure, consequence relation and logic. In: Gabbay, D.M. (ed.) What is a logical system?, pp. 239–259. Oxford University Press (1994)

    Google Scholar 

  2. de Swart, H.C.: A Gentzen- or Beth-type system, a practical decision procedure and a constructive completeness proof for the counterfactual logics VC and VCS. J. Symb. Log. 48(1), 1–20 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  3. Friedman, N., Halpern, J.Y.: On the complexity of conditional logics. In: KR 1994, pp. 202–213 (1994)

    Google Scholar 

  4. Gent, I.P.: A sequent- or tableau-style system for Lewis’s counterfactual logic VC. Notre Dame J. Form. Log. 33(3), 369–382 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  5. Gentzen, G.: Untersuchungen über das logische Schließen. I. Math. Z. 39(2), 176–210 (1934)

    MathSciNet  MATH  Google Scholar 

  6. Ginsberg, M.L.: Counterfactuals. Artif. Intell. 30, 35–79 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  7. Giordano, L., Gliozzi, V., Olivetti, N., Pozzato, G.L.: Analytic tableaux calculi for KLM logics of nonmonotonic reasoning. ACM Trans. Comput. Log. 10(3) (2009)

    Google Scholar 

  8. Giordano, L., Gliozzi, V., Olivetti, N., Schwind, C.: Tableau calculus for preference-based conditional logics: PCL and its extensions. ACM Trans. Comput. Log. 10(3), 1–50 (2009)

    MathSciNet  MATH  Google Scholar 

  9. Groeneboer, C., Delgrande, J.P.: Tableau-based theorem proving in normal conditional logics. In: AAAI, pp. 171–176 (1988)

    Google Scholar 

  10. Lellmann, B., Pattinson, D.: Cut Elimination for Shallow Modal Logics. In: Brünnler, K., Metcalfe, G. (eds.) TABLEAUX 2011. LNCS, vol. 6793, pp. 211–225. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  11. Lewis, D.: Counterfactuals. Blackwell (1973)

    Google Scholar 

  12. Myers, R., Pattinson, D., Schröder, L.: Coalgebraic Hybrid Logic. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol. 5504, pp. 137–151. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  13. Nute, D., Cross, C.B.: Conditional logic. In: Gabbay, D.M., Guenthner, F. (eds.) Handbook of Philosophical Logic, vol. 4, pp. 1–98. Kluwer (2001)

    Google Scholar 

  14. Olivetti, N., Pozzato, G.L., Schwind, C.: A sequent calculus and a theorem prover for standard conditional logics. ACM Trans. Comput. Log. 8(4), 1–51 (2007)

    Article  MathSciNet  Google Scholar 

  15. Pattinson, D., Schröder, L.: Generic modal cut elimination applied to conditional logics. Log. Methods Comput. Sci. 7(1) (2011)

    Google Scholar 

  16. Sano, K.: Hybrid counterfactual logics - David Lewis meets Arthur Prior again. J. Log. Lang. Inf. 18, 515–539 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  17. Schröder, L., Pattinson, D., Hausmann, D.: Optimal tableaux for conditional logics with cautious monotonicity. In: ECAI, pp. 707–712 (2010)

    Google Scholar 

  18. Troelstra, A.S., Schwichtenberg, H.: Basic Proof Theory, 2nd edn. Cambridge University Press (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing, Imperial College London, UK

    Björn Lellmann & Dirk Pattinson

Authors
  1. Björn Lellmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dirk Pattinson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut de Recherche en Informatique de Toulouse, 118 route de Narbonne, 31062, Toulouse Cedex 9, France

    Luis Fariñas del Cerro , Andreas Herzig  & Jérôme Mengin ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lellmann, B., Pattinson, D. (2012). Sequent Systems for Lewis’ Conditional Logics. In: del Cerro, L.F., Herzig, A., Mengin, J. (eds) Logics in Artificial Intelligence. JELIA 2012. Lecture Notes in Computer Science(), vol 7519. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33353-8_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33353-8_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33352-1

  • Online ISBN: 978-3-642-33353-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation