Simplicity, Language-Dependency and the Best System Account of Laws
dc.contributor.author | Wheeler, Billy | |
dc.date.accessioned | 2024-03-02T18:40:44Z | |
dc.date.available | 2024-03-02T18:40:44Z | |
dc.date.issued | 2015-10 | |
dc.identifier.uri | https://vinspace.edu.vn/handle/VIN/25 | |
dc.description.abstract | It is often said that the best system account of laws(BSA) needs supplementing with a theory of perfectly natural properties. The ‘strength’ and ‘simplicity’ of a systemis language-relative and without a fixed vocabulary it is impossible to compare rival systems. Recently a number of philosophers have attempted to reformulate the BSA in an effort to avoid commitment to natural properties.I assess these proposals and argue that they are problematic as they stand. Nonetheless, I agree with their aim, and show that if simplicity is interpreted as ‘compression’, algorithmic information theory provides a framework for system comparison without the need for natural properties. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Theoria: An International Journal for Theory, History and Foundations of Science | en_US |
dc.subject | Laws of nature | en_US |
dc.subject | Best system account | en_US |
dc.subject | Natural properties | en_US |
dc.subject | Algorithmic information theory | en_US |
dc.subject | Invariance theorem | en_US |
dc.title | Simplicity, Language-Dependency and the Best System Account of Laws | en_US |
dc.type | Article | en_US |
Files in this item
This item appears in the following Collection(s)
-
Dr. Billy Wheeler [6]
PhD HASS Program Director, College of Arts and Sciences