Closer

Cite This

Files in this item

Checksum: MD5:d0a34db7a2db7c945992b7fbd9b18056

DE CLERCQ, Rafael, Leon HORSTEN, 2005. Closer. In: Synthese. Springer. 146(3), pp. 371-393. ISSN 0039-7857. eISSN 1573-0964. Available under: doi: 10.1007/s11229-004-6219-1

@article{DeClercq2005Close-56729, title={Closer}, year={2005}, doi={10.1007/s11229-004-6219-1}, number={3}, volume={146}, issn={0039-7857}, journal={Synthese}, pages={371--393}, author={De Clercq, Rafael and Horsten, Leon} }

<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/56729"> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/56729"/> <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:issued>2005</dcterms:issued> <dcterms:title>Closer</dcterms:title> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/56729/3/DeClercq_2-1jxywg2ncp3wm1.pdf"/> <dc:contributor>Horsten, Leon</dc:contributor> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:rights>terms-of-use</dc:rights> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/40"/> <dc:contributor>De Clercq, Rafael</dc:contributor> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/40"/> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2022-03-02T16:09:21Z</dc:date> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/56729/3/DeClercq_2-1jxywg2ncp3wm1.pdf"/> <dc:creator>De Clercq, Rafael</dc:creator> <dc:creator>Horsten, Leon</dc:creator> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2022-03-02T16:09:21Z</dcterms:available> <dcterms:abstract xml:lang="eng">Criteria of identity should mirror the identity relation in being reflexive, symmetrical, and transitive. However, this logical requirement is only rarely met by the criteria that we are most inclined to propose as candidates. The present paper addresses the question how such obvious candidates are best approximated by means of relations that have all of the aforementioned features, i.e., which are equivalence relations. This question divides into two more basic questions. First, what is to be considered a ‘best’ approximation. And second, how can these best approximations be found? In answering these questions, we both rely on and constructively criticize ground-breaking work done by Timothy Williamson. Guiding ideas of our approach are that we allow approximations by means of overlapping equivalence-relations, and that closeness of approximation is measured in terms of the number of mistakes made by the approximation when compared to the obvious candidate criterion.</dcterms:abstract> <dc:language>eng</dc:language> </rdf:Description> </rdf:RDF>

Downloads since Mar 2, 2022 (Information about access statistics)

DeClercq_2-1jxywg2ncp3wm1.pdf 45

This item appears in the following Collection(s)

Search KOPS


Browse

My Account