Enumerative Induction and Lawlikeness

Cite This

Files in this item

Checksum: MD5:bd3538852123f14066fd6e7a797e0d61

SPOHN, Wolfgang, 2005. Enumerative Induction and Lawlikeness. In: Philosophy of Science. 72(1), pp. 164-187

@article{Spohn2005Enume-3539, title={Enumerative Induction and Lawlikeness}, year={2005}, number={1}, volume={72}, journal={Philosophy of Science}, pages={164--187}, author={Spohn, Wolfgang} }

<rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:void="http://rdfs.org/ns/void#" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/rdf/resource/123456789/3539"> <dcterms:abstract xml:lang="eng">The paper is based on ranking theory, a theory of degrees of disbelief (and hence belief). On this basis, it explains enumerative induction, the confirmation of a law by its positive instances, which may indeed take various schemes. It gives a ranking theoretic explication of a possible law or a nomological hypothesis. It proves, then, that such schemes of enumerative induction uniquely correspond to mixtures of such nomological hypotheses. Thus, it shows that de Finetti's probabilistic representation theorems may be transformed into an account of confirmation of possible laws and that enumerative induction is equivalent to such an account. The paper concludes with some remarks about the apriority of lawfulness or the uniformity of nature.</dcterms:abstract> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-23T13:46:41Z</dcterms:available> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/40"/> <dc:creator>Spohn, Wolfgang</dc:creator> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:issued>2005</dcterms:issued> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/3539/1/Spohn_2005_Enumerative_Induction.pdf"/> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/3539/1/Spohn_2005_Enumerative_Induction.pdf"/> <dcterms:title>Enumerative Induction and Lawlikeness</dcterms:title> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-23T13:46:41Z</dc:date> <dcterms:bibliographicCitation>First publ. in: Philosophy of Science 72 (2005), 1, pp. 164-187</dcterms:bibliographicCitation> <dc:rights>terms-of-use</dc:rights> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/3539"/> <dc:language>eng</dc:language> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/40"/> <dc:format>application/pdf</dc:format> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dcterms:rights rdf:resource="https://creativecommons.org/licenses/by-nc-nd/2.0/legalcode"/> <dc:contributor>Spohn, Wolfgang</dc:contributor> </rdf:Description> </rdf:RDF>

Downloads since Oct 1, 2014 (Information about access statistics)

Spohn_2005_Enumerative_Induction.pdf 161

This item appears in the following Collection(s)

terms-of-use Except where otherwise noted, this item's license is described as terms-of-use

Search KOPS


Browse

My Account