Background: Gibbard’s (Informal) Argument
Gibbard [2] presents an argument to the effect that any conditional satisfying certain principles must be equivalent to the material (viz., classical) conditional. Here is one rendition of Gibbard’s (informal) argument.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Claessen, K., Sorensson, N.: New techniques that improve mace-style finite model finding. In: Proceedings of the CADE-19 Workshop: Model Computation—Principles, Algorithms, Applications (2003)
Gibbard, A.: Two recent theories of conditionals. In: Harper, W.L., Stalnaker, R., Pearce, G. (eds.) Ifs: Conditionals, Belief, Decision, Chance and Time. Reidel (1981)
Kalman, J.: Automated Reasoning with otter. Rinton Press (2001)
McCune, W.: Prover9 and mace4, http://www.cs.unm.edu/~mccune/mace4/
Riazanov, A., Voronkov, A.: The design and implementation of vampire. AI Communications (2002)
Veroff, R.: Solving open questions and other challenge problems using proof sketches. Journal of Automated Reasoning (2001)
Wos, L.: Automating the search for elegant proofs. Journal of Automated Reasoning (1998)
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Fitelson, B. (2013). Gibbard’s Collapse Theorem for the Indicative Conditional: An Axiomatic Approach. In: Bonacina, M.P., Stickel, M.E. (eds) Automated Reasoning and Mathematics. Lecture Notes in Computer Science(), vol 7788. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36675-8_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-36675-8_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36674-1
Online ISBN: 978-3-642-36675-8
eBook Packages: Computer ScienceComputer Science (R0)