Publikation: Closer
Lade...
Dateien
Datum
2005
Autor:innen
De Clercq, Rafael
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
URI (zitierfähiger Link)
DOI (zitierfähiger Link)
Internationale Patentnummer
Link zur Lizenz
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Open Access Green
Sammlungen
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Zeitschriftenartikel
Publikationsstatus
Published
Erschienen in
Synthese. Springer. 2005, 146(3), pp. 371-393. ISSN 0039-7857. eISSN 1573-0964. Available under: doi: 10.1007/s11229-004-6219-1
Zusammenfassung
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.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
100 Philosophie
Schlagwörter
Konferenz
Rezension
undefined / . - undefined, undefined
Zitieren
ISO 690
DE CLERCQ, Rafael, Leon HORSTEN, 2005. Closer. In: Synthese. Springer. 2005, 146(3), pp. 371-393. ISSN 0039-7857. eISSN 1573-0964. Available under: doi: 10.1007/s11229-004-6219-1BibTex
@article{DeClercq2005Close-56729,
year={2005},
doi={10.1007/s11229-004-6219-1},
title={Closer},
number={3},
volume={146},
issn={0039-7857},
journal={Synthese},
pages={371--393},
author={De Clercq, Rafael and Horsten, Leon}
}RDF
<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/56729">
<bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/56729"/>
<dc:contributor>Horsten, Leon</dc:contributor>
<dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/56729/3/DeClercq_2-1jxywg2ncp3wm1.pdf"/>
<dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/40"/>
<dc:creator>Horsten, Leon</dc:creator>
<foaf:homepage rdf:resource="http://localhost:8080/"/>
<dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
<dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/40"/>
<void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
<dcterms:title>Closer</dcterms:title>
<dc:rights>terms-of-use</dc:rights>
<dc:language>eng</dc:language>
<dcterms:issued>2005</dcterms:issued>
<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>
<dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2022-03-02T16:09:21Z</dcterms:available>
<dc:creator>De Clercq, Rafael</dc:creator>
<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:contributor>De Clercq, Rafael</dc:contributor>
</rdf:Description>
</rdf:RDF>Interner Vermerk
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Prüfungsdatum der Dissertation
Finanzierungsart
Kommentar zur Publikation
Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Nein
Begutachtet
Ja
