Abstract
The aim of the present paper is to introduce a new logic, PUC-Logic, which will be used to give a systematic account of well-known counterfactuals conditionals on the basis of a concept of proximity. We will formulate a natural deduction system for PUC-Logic, the system PUC-ND, that will be shown to be sound and complete with respect to the semantics of PUC-Logic. We shall also prove that PUC-Logic is decidable and that the system PUC-ND satisfies the normalization theorem.
R.Q. de Araujo Fernandes—We would like to thank PUC-Rio for the VRac sponsorship and DAAD (Germany) for the Specialist Literature Programme.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
The expression state-of-affairs is here used in an intuititive and very general sense as a kind of “truth-maker”, as that piece of reality that is responsible for the truth of a proposition (as Michael Dummett [16] would put it). There’s a long and important discussion in Philosophy as to the true nature of state-of-affairs, but to get into this discussion is clearly beyond the scope of the presente paper.
- 2.
\(\$_{i}\) gives the neighborhoods around the world i. They are the available strictness to evaluate counterfactuals at i.
- 3.
A \(\phi \)-world is a world in which \(\phi \) holds.
- 4.
- 5.
This definition of database which includes a first-order model B and not only the integrity constraints is similar to the definition of a relational database in [17].
- 6.
\(\alpha (b_1,\ldots ,b_n)\) is an abuse of notation; it means that \(b_i\) is assigned to \(x_i\) by means of some assignment function.
- 7.
We are going to use labels in the spirit of labelled deductive systems, as it is used by Gabbay and Negri. Labels help us to push down semantic notions into the syntax (see, for example, [22]).
- 8.
We use the term wff to denote both the singular and the plural form of the expression well-formed formula.
References
Lewis, D.K.: Counterfactuals. Blackwell Publishing, Oxford (2008)
Goodman, N.: Fact, Fiction, and Forecast, 4th edn. Harvard University Press, Cambridge (1983)
Bell, J.L.: Toposes and Local Set Theories. Dover Publications, Mineola (2008)
Bonner, A.J.: Hypothetical datalog: complexity and expressibility. Theor. Comput. Sci. (TCS) 76, 3–51 (1990)
Knuth, D.E.: Semantics of context-free languages. Math. Syst. Theory 2, 127–146 (1968)
Gabbay, D., Giordano, L., Martelli, A., Olivetti, N.: Hypothetical updates, priority and inconsistency in a logic programming language. In: Marek, V.W., Nerode, A., Truszczyński, M. (eds.) LPNMR 1995. LNCS, vol. 928, pp. 203–216. Springer, Heidelberg (1995). doi:10.1007/3-540-59487-6_15
Prawitz, D., Deduction, N.: A Proof-Theoretical Study. Dover, Mineola (2006)
Ramsey, F.P.: Philosophical Papers. Cambridge University Press, Cambridge (1990)
Malhotra, A., Younesi, E., Bagewadi, S., Hofmann-Apitius, M.: Linking hypothetical knowledge patterns to disease molecular signatures for biomarker discovery in Alzheimer’s disease. Genome Med. 6, 97 (2014)
Gent, I.P.: A sequent- or tableau-style system for Lewis’s counterfactual logic VC. Notre Dame J. Formal Logic 33(3), 369–382 (1992)
Bonevac, D.: Deduction: Introductory Symbolic Logic. Blackwell, Oxford (2003)
Sano, K.: Hybrid counterfactual logics. J. Logic Lang. Inform. 18(4), 515–539 (2009)
Kifer, M., Swift, T., Grosof, B.: Practical knowledge representation and reasoning in Ergo. In: Tutorial, RuleML2016 (2016)
Golfarelli, M., Rizzi, S.: What-if simulation modeling in business intelligence. Int. J. Data Warehouse Min. 5(4), 24–43 (2009)
Fernandes, R.Q.A., Haeusler, E.H.: A Topos-theoretic approach to counterfactual logic. In: Pre-proceedings of Fourth Workshop on Logical and Semantic Frameworks, Brasília (2009)
Dummet, M.A.E.: What is a theory of meaning ? (II). In: Evans, G., McDowell, J. (eds.) Truth and Meaning, pp. 67–137. Clarendon press (1976)
Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Boston (1995)
Lambert, K.: Free Logic: Selected Essays. Cambridge University Press, Cambridge (2004)
Cook, S.A.: The complexity of theorem proving procedures. In: 3rd Annual ACM Symposium on the Theory of Computation, pp. 151–158 (1971)
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). doi:10.1007/978-3-642-33353-8_25
Pereira, L.M., Aparício, J.N., Alfares, J.J.: Counterfactual reasoning based on revising assumptions. In: Proceedings of the 1991 Internal Symposium Logic Programming. MIT Press (1991)
Renteria, C.J., Haeusler, E.H., Veloso, P.A.S.: NUL: natural deduction for ultrafilter logic. Bull. Sect. Logic 32(4), 191–199 (2003). Univ. of Lodz, Polland
Fernandes, R.Q.A., Haeusler, E.H., Pereira, L.C.P.D.: PUC-Logic, ArXiv CoRR (2014)
Negri, S., Sbardolini, G.: Proof analysis for lewis counterfactuals. Rev. Symbolic Logic 9(01), 44–75 (2016)
Li, G.: Knowledge discovery from knowledge bases with higher-order logic. In: Wong, W.E. (ed.) Proceedings of the 4th International Conference on Computer Engineering and Networks, pp. 451–457. Springer, Cham (2015). doi:10.1007/978-3-319-11104-9_53
Winslett, M.: Updating Logical Databases, Cambridge Tracts in Theoretical Computer Science, vol. 9. Cambridge University Press, Cambridge (1990)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer-Verlag GmbH Germany
About this chapter
Cite this chapter
de Araujo Fernandes, R.Q., Haeusler, E.H., Pereira, L.C.P.D. (2017). A Proximity-Based Understanding of Conditionals. In: Hameurlain, A., Küng, J., Wagner, R., Decker, H. (eds) Transactions on Large-Scale Data- and Knowledge-Centered Systems XXXIV. Lecture Notes in Computer Science(), vol 10620. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-55947-5_6
Download citation
DOI: https://doi.org/10.1007/978-3-662-55947-5_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-55946-8
Online ISBN: 978-3-662-55947-5
eBook Packages: Computer ScienceComputer Science (R0)