Abstract
The logic \({\mathbb V}\) is the basic logic of counterfactuals in the family of Lewis’ systems. It is characterized by the whole class of so-called sphere models. We propose a new sequent calculus for this logic. Our calculus takes as primitive Lewis’ connective of comparative plausibility ≼: a formula A ≼ B intuitively means that A is at least as plausible as B. Our calculus is standard in the sense that each connective is handled by a finite number of rules with a fixed and finite number of premises. Moreover our calculus is “internal”, in the sense that each sequent can be directly translated into a formula of the language. We show that the calculus provides an optimal decision procedure for the logic \(\mathbb{V}\).
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Avron, A.: The method of hypersequents in the proof theory of propositional non-classical logics. In: Logic: From Foundations to Applications, pp. 1–32 (1996)
Baltag, A., Smets, S.: The logic of conditional doxastic actions. Texts in Logic and Games, Special Issue on New Perspectives on Games and Interaction 4, 9–31 (2008)
Board, O.: Dynamic interactive epistemology. Games and Econ. Behavior 49(1), 49–80 (2004)
Boutilier, C.: Conditional logics of normality: a modal approach. AIJ 68(1), 87–154 (1994)
Chellas, B.F.: Basic conditional logics. Journal of Philosophical Logic 4, 133–153 (1975)
Gent, I.P.: A sequent or tableaux-style system for Lewis’s counterfactual logic \(\mathbb{VC}\). Notre Dame Journal of Formal Logic 33(3), 369–382 (1992)
Ginsberg, M.L.: Counterfactuals. Artificial Intelligence 30(1), 35–79 (1986)
Giordano, L., Gliozzi, V., Olivetti, N.: Weak AGM postulates and strong ramsey test: A logical formalization. Artificial Intelligence 168(1-2), 1–37 (2005)
Giordano, L., Gliozzi, V., Olivetti, N., Schwind, C.: Tableau calculus for preference-based conditional logics: PCL and its extensions. ACM Trans. Comput. Logic 10(3) (2009)
Grahne, G.: Updates and counterfactuals. J. of Logic and Computation 8(1), 87–117 (1998)
Kraus, S., Lehmann, D., Magidor, M.: Nonmonotonic reasoning, preferential models and cumulative logics. Artificial Intelligence 44(1-2), 167–207 (1990)
Lamarre, P.: Etude des raisonnements non-monotones: Apports des logiques des conditionnels et des logiques modales. PhD thesis, Université Paul Sabatier, Toulouse (1992)
Lehmann, D., Magidor, M.: What does a conditional knowledge base entail? Artificial Intelligence 55(1), 1–60 (1992)
Lellmann, B., Pattinson, D.: Sequent Systems for Lewis’ Conditional Logics. In: del Cerro, L.F., Herzig, A., Mengin, J. (eds.) JELIA 2012. LNCS, vol. 7519, pp. 320–332. Springer, Heidelberg (2012)
Lewis, D.: Counterfactuals. Basil Blackwell Ltd (1973)
Metcalfe, G., Olivetti, N., Gabbay, D.: Proof Theory for Fuzzy Logics. Springer (2010)
Negri, S., Sbardolini, G.: Proof analysis for Lewis counterfactuals. Tech. Rep. (2014), http://www.helsinki.fi/%7enegri/PALC.pdf
Nute, D.: Topics in conditional logic. Reidel, Dordrecht (1980)
Olivetti, N., Pozzato, G.L.: A sequent calculus for Lewis logic \(\mathbb{V}\): preliminary results. Tech. Rep. (2015), http://www.di.unito.it/%7epozzato/papers/RT0115.pdf
de Swart, H.C.M.: A gentzen- or beth-type system, a practical decision procedure and a constructive completeness proof for the counterfactual logics \(\mathbb{VC}\) and \(\mathbb{VCS}\). Journal of Symbolic Logic 48(1), 1–20 (1983)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Olivetti, N., Pozzato, G.L. (2015). A Standard Internal Calculus for Lewis’ Counterfactual Logics. In: De Nivelle, H. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 2015. Lecture Notes in Computer Science(), vol 9323. Springer, Cham. https://doi.org/10.1007/978-3-319-24312-2_19
Download citation
DOI: https://doi.org/10.1007/978-3-319-24312-2_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-24311-5
Online ISBN: 978-3-319-24312-2
eBook Packages: Computer ScienceComputer Science (R0)