Computation, Laws and Supervenience

Abstract

The Computational Theory of the Laws of Nature entails that the accessibility relation for nomological necessity is not symmetric or transitive. This means that nomologically possible worlds need not share our world's laws. This subverts a standard style of argument against Humean Supervenience.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

External links

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

Through your library

  • Only published works are available at libraries.

Analytics

Added to PP
2014-02-03

Downloads
108 (#159,595)

6 months
2 (#1,232,442)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Terrance A. Tomkow
Cambridge University (PhD)

Citations of this work

Simplicity, Language-Dependency and the Best System Account of Laws.Billy Wheeler - 2014 - Theoria : An International Journal for Theory, History and Fundations of Science 31 (2):189-206.

Add more citations

References found in this work

No references found.

Add more references