@incollection{Spohn2004Persi-3562,
  year={2004},
  title={Laws Are Persistent Inductives Schemes},
  publisher={Kluwer},
  address={Dordrecht},
  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/server/rdf/resource/123456789/3562">
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-23T13:46:45Z</dc:date>
    <dc:language>eng</dc:language>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:bibliographicCitation>First publ. in: Induction and Deduction in the Sciences / F. Stadler (ed.). - Dordrecht: Kluwer, 2004, pp. 135-150</dcterms:bibliographicCitation>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/40"/>
    <dc:format>application/pdf</dc:format>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/40"/>
    <dc:rights>Attribution-NonCommercial-NoDerivs 2.0 Generic</dc:rights>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/3562/1/Spohn_2004_Laws_Are_Persistent.pdf"/>
    <dcterms:title>Laws Are Persistent Inductives Schemes</dcterms:title>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/3562"/>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/3562/1/Spohn_2004_Laws_Are_Persistent.pdf"/>
    <dc:contributor>Spohn, Wolfgang</dc:contributor>
    <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:rights rdf:resource="http://creativecommons.org/licenses/by-nc-nd/2.0/"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:creator>Spohn, Wolfgang</dc:creator>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-23T13:46:45Z</dcterms:available>
    <dcterms:issued>2004</dcterms:issued>
  </rdf:Description>
</rdf:RDF>