Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

Recursive Abduction and Universality of Physical Laws: A Logical Analysis Based on Case Studies

Version 1 : Received: 11 December 2017 / Approved: 19 December 2017 / Online: 19 December 2017 (09:13:07 CET)
Version 2 : Received: 10 February 2018 / Approved: 11 February 2018 / Online: 11 February 2018 (04:35:28 CET)

How to cite: He, Y. Recursive Abduction and Universality of Physical Laws: A Logical Analysis Based on Case Studies. Preprints 2017, 2017120134. https://doi.org/10.20944/preprints201712.0134.v1 He, Y. Recursive Abduction and Universality of Physical Laws: A Logical Analysis Based on Case Studies. Preprints 2017, 2017120134. https://doi.org/10.20944/preprints201712.0134.v1

Abstract

The paper studies some cases in physics such as Galilean inertia motion and etc., and hereby, presents a logical schema of recursive abduction, from which we can derive the universality of physical law in an effective logical path without infinite induction asked. Recursive abduction provides an effective logical path to connect a universal physical law with finite empirical observations basing on the both quasi-law tautology and suitable recursive dimension, the two new concepts introduced in this paper. Under the viewpoint of recursive abduction, the historically lasting difficulty from Hume’s problem naturally vanishes. In Hume’s problem one always misunderstood the universality of natural law as a product of empirical induction and the time-recursive issue as an infinitely inductive problem and, thus, sank into the inescapable quagmire. The paper gives a concluding discussion to Hume’s problem in the new effective logical schema.

Keywords

Abduction; Recursion; Physical law; Hume’s problem

Subject

Physical Sciences, Theoretical Physics

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.