Aufgrund von Vorbereitungen auf eine neue Version von KOPS, können kommenden Montag und Dienstag keine Publikationen eingereicht werden. (Due to preparations for a new version of KOPS, no publications can be submitted next Monday and Tuesday.)

Enumerative induction

Cite This

Files in this item

Checksum: MD5:ab1cfb431a1656b8ddf4b05fe56cc524

SPOHN, Wolfgang, 2003. Enumerative induction. TARK '03: 9th conference on Theoretical aspects of rationality and knowledge. Bloomington, IN, Jun 20, 2003 - Jun 22, 2003. In: TENNENHOLTZ, Moshe, ed.. TARK '03 : Proceedings of the 9th conference on Theoretical aspects of rationality and knowledge. New York, NY:ACM, pp. 131-144. ISBN 978-1-58113-731-6. Available under: doi: 10.1145/846241.846260

@inproceedings{Spohn2003Enume-59353, title={Enumerative induction}, year={2003}, doi={10.1145/846241.846260}, isbn={978-1-58113-731-6}, address={New York, NY}, publisher={ACM}, booktitle={TARK '03 : Proceedings of the 9th conference on Theoretical aspects of rationality and knowledge}, pages={131--144}, editor={Tennenholtz, Moshe}, author={Spohn, Wolfgang} }

<rdf:RDF xmlns:dcterms="" xmlns:dc="" xmlns:rdf="" xmlns:bibo="" xmlns:dspace="" xmlns:foaf="" xmlns:void="" xmlns:xsd="" > <rdf:Description rdf:about=""> <dc:language>eng</dc:language> <dcterms:isPartOf rdf:resource=""/> <dcterms:rights rdf:resource=""/> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dspace:hasBitstream rdf:resource=""/> <dcterms:available rdf:datatype="">2022-11-30T14:25:29Z</dcterms:available> <bibo:uri rdf:resource=""/> <dcterms:issued>2003</dcterms:issued> <dc:rights>terms-of-use</dc:rights> <dcterms:title>Enumerative induction</dcterms:title> <dcterms:hasPart rdf:resource=""/> <dspace:isPartOfCollection rdf:resource=""/> <dc:creator>Spohn, Wolfgang</dc:creator> <dcterms:abstract xml:lang="eng">The paper explains enumerative induction, the confirmation of a law by its positive instances, in ranking theoretic terms. It gives a ranking theoretic explication of a possible law or a nomological hypothesis. And it shows, finally, that such schemes of enumerative induction uniquely correspond to mixtures of such nomological hypotheses. Thus the paper shows that de Finetti's probabilistic representation theorems may be directly transformed into an account of confirmation of possible laws and that enumerative induction is equivalent to such an account.</dcterms:abstract> <dc:date rdf:datatype="">2022-11-30T14:25:29Z</dc:date> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:contributor>Spohn, Wolfgang</dc:contributor> </rdf:Description> </rdf:RDF>

Downloads since Nov 30, 2022 (Information about access statistics)

Spohn_2-1t764a20cquhm0.pdf 29

This item appears in the following Collection(s)

Search KOPS


My Account