Truthlikeness for probabilistic laws

Synthese 199 (3-4):9359-9389 (2021)
  Copy   BIBTEX

Abstract

Truthlikeness is a property of a theory or a proposition that represents its closeness to the truth. We start by summarizing Niiniluoto’s proposal of truthlikeness for deterministic laws, which defines truthlikeness as a function of accuracy, and García-Lapeña’s expanded version, which defines truthlikeness for DL as a function of two factors, accuracy and nomicity. Then, we move to develop an appropriate definition of truthlikeness for probabilistic laws based on Niiniluoto’s suggestion to use the Kullback–Leibler divergence to define the distance between a probability law X\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$X$$\end{document} and the true probability law T\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$T$$\end{document}. We argue that the Kullback–Leibler divergence seems to be the best of the available probability distances to measure accuracy between PL. However, as in the case of DL, we argue that accuracy represents a necessary but not sufficient condition, as two PL may be equally accurate and still one may imply more true or truthlike consequences, behaviours or true facts about the system than the other. The final proposal defines truthlikeness for PL as a function of two factors, p-accuracy and p-nomicity, in intimate connexion with García-Lapeña’s proposal for DL.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,486

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Hard Provability Logics.Mojtaba Mojtahedi - 2021 - In Mojtaba Mojtahedi, Shahid Rahman & MohammadSaleh Zarepour, Mathematics, Logic, and their Philosophies: Essays in Honour of Mohammad Ardeshir. Springer. pp. 253-312.
Isomorphic and strongly connected components.Miloš S. Kurilić - 2015 - Archive for Mathematical Logic 54 (1-2):35-48.
Peter Fishburn’s analysis of ambiguity.Mark Shattuck & Carl Wagner - 2016 - Theory and Decision 81 (2):153-165.
Minimal elementary end extensions.James H. Schmerl - 2017 - Archive for Mathematical Logic 56 (5-6):541-553.
A remark on hereditarily nonparadoxical sets.Péter Komjáth - 2016 - Archive for Mathematical Logic 55 (1-2):165-175.

Analytics

Added to PP
2021-06-19

Downloads
31 (#776,157)

6 months
6 (#622,431)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Framing the Epistemic Schism of Statistical Mechanics.Javier Anta - 2021 - Proceedings of the X Conference of the Spanish Society of Logic, Methodology and Philosophy of Science.

Add more citations

References found in this work

The metaphysics within physics.Tim Maudlin - 2007 - New York: Oxford University Press.
Likeness to Truth.Graham Oddie - 1986 - Dordrecht and Boston: Reidel.
Truth-Seeking by Abduction.Ilkka Niiniluoto - 2018 - Cham, Switzerland: Springer.
On Popper's definitions of verisimilitude.Pavel Tichý - 1974 - British Journal for the Philosophy of Science 25 (2):155-160.
A Mathematical Theory of Communication.Claude Elwood Shannon - 1948 - Bell System Technical Journal 27 (April 1924):379–423.

View all 35 references / Add more references