Laws Are Persistent Inductives Schemes

Cite This

Files in this item

Checksum: MD5:41e33fc4184fbbe0f7bef93ece4dbea5

SPOHN, Wolfgang, 2004. Laws Are Persistent Inductives Schemes. In: STADLER, F., ed.. Induction and Deduction in the Sciences. Dordrecht:Kluwer, pp. 135-150

@incollection{Spohn2004Persi-3562, title={Laws Are Persistent Inductives Schemes}, year={2004}, address={Dordrecht}, publisher={Kluwer}, booktitle={Induction and Deduction in the Sciences}, pages={135--150}, editor={Stadler, F.}, 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/3562"> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/40"/> <dcterms:bibliographicCitation>First publ. in: Induction and Deduction in the Sciences / F. Stadler (ed.). - Dordrecht: Kluwer, 2004, pp. 135-150</dcterms:bibliographicCitation> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-23T13:46:45Z</dc:date> <dcterms:issued>2004</dcterms:issued> <dc:rights>terms-of-use</dc:rights> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-23T13:46:45Z</dcterms:available> <dc:creator>Spohn, Wolfgang</dc:creator> <dc:format>application/pdf</dc:format> <dcterms:abstract xml:lang="eng">The characteristic difference between laws and accidental generalizations lies in our epistemic or inductive attitude towards them. This idea has taken various forms and dominated the discussion about lawlikeness in the last decades. Hence, ranking theory with its resources of formalizing defeasible reasoning or inductive schemes seems ideally suited to explicate the idea in a formal way. This is what the paper attempts to do. Thus it will turn out that a law is simply the deterministic analogue of a sequence of independent, identically distributed random variables. This entails that de Finetti's representation theorems can be directly transformed into an account of confirmation of laws thus conceived.</dcterms:abstract> <dcterms:title>Laws Are Persistent Inductives Schemes</dcterms:title> <dcterms:rights rdf:resource="https://creativecommons.org/licenses/by-nc-nd/2.0/legalcode"/> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/3562/1/Spohn_2004_Laws_Are_Persistent.pdf"/> <dc:language>eng</dc:language> <dc:contributor>Spohn, Wolfgang</dc:contributor> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/40"/> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/3562/1/Spohn_2004_Laws_Are_Persistent.pdf"/> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/3562"/> </rdf:Description> </rdf:RDF>

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

Spohn_2004_Laws_Are_Persistent.pdf 131

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