Generalized Effective Reducibility

Zitieren

Dateien zu dieser Ressource

Dateien Größe Format Anzeige

Zu diesem Dokument gibt es keine Dateien.

CARL, Merlin, 2016. Generalized Effective Reducibility. 12th Conference on Computability in Europe, CiE 2016. Paris, 27. Jun 2016 - 1. Jul 2016. In: BECKMANN, Arnold, ed. and others. Pursuit of the Universal : 12th Conference on Computability in Europe, CiE 2016, Paris, France, June 27 - July 1, 2016; Proceedings. 12th Conference on Computability in Europe, CiE 2016. Paris, 27. Jun 2016 - 1. Jul 2016. Cham:Springer, pp. 225-233. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-319-40188-1. Available under: doi: 10.1007/978-3-319-40189-8_23

@inproceedings{Carl2016-06-14Gener-39703, title={Generalized Effective Reducibility}, year={2016}, doi={10.1007/978-3-319-40189-8_23}, number={9709}, isbn={978-3-319-40188-1}, issn={0302-9743}, address={Cham}, publisher={Springer}, series={Lecture Notes in Computer Science}, booktitle={Pursuit of the Universal : 12th Conference on Computability in Europe, CiE 2016, Paris, France, June 27 - July 1, 2016; Proceedings}, pages={225--233}, editor={Beckmann, Arnold}, author={Carl, Merlin} }

<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/39703"> <dc:language>eng</dc:language> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/39"/> <dc:creator>Carl, Merlin</dc:creator> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/39"/> <dcterms:abstract xml:lang="eng">We introduce two notions of effective reducibility for set-theoretical statements, based on computability with Ordinal Turing Machines (OTMs), one of which resembles Turing reducibility while the other is modelled after Weihrauch reducibility. We give sample applications by showing that certain (algebraic) constructions are not effective in the OTM-sense and considering the effective equivalence of various versions of the axiom of choice.</dcterms:abstract> <dc:contributor>Carl, Merlin</dc:contributor> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2017-07-31T13:55:22Z</dcterms:available> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/39703"/> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2017-07-31T13:55:22Z</dc:date> <dcterms:issued>2016-06-14</dcterms:issued> <dcterms:title>Generalized Effective Reducibility</dcterms:title> </rdf:Description> </rdf:RDF>

Das Dokument erscheint in:

KOPS Suche


Stöbern

Mein Benutzerkonto