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

Recursive Abduction and the 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 the Universality of Physical Laws: A Logical Analysis Based on Case Studies. Preprints 2017, 2017120134. https://doi.org/10.20944/preprints201712.0134.v2 He, Y. Recursive Abduction and the Universality of Physical Laws: A Logical Analysis Based on Case Studies. Preprints 2017, 2017120134. https://doi.org/10.20944/preprints201712.0134.v2

Abstract

The paper studies some cases in physics such as Galilean inertia motion and etc., and presents a logical schema of recursive abduction, from which we can derive the universality of physical laws in an effective logical path without requiring infinite inductions. Recursive abduction provides an effective logical framework to connect a universal physical law with finite empirical observations based on both quasi-law tautologies and suitable recursive dimensions, two new concepts introduced in this paper. Under the viewpoint of recursive abduction, the historical difficulty from Hume’s problem naturally vanishes. In Hume’s problem one always misunderstood a time-recursive issue as an infinitely inductive problem and, thus, sank into an inescapable quagmire. With this new effective logical schema, the paper gives a concluding discussion to Hume’s problem and justifies the validity of probability argument for natural laws.

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
Metrics 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.