Human-Effective Computability
| dc.contributor.author | Antonutti Marfori, Marianna | |
| dc.contributor.author | Horsten, Leon | |
| dc.date.accessioned | 2020-02-14T13:39:10Z | |
| dc.date.available | 2020-02-14T13:39:10Z | |
| dc.date.issued | 2019-02-01 | eng |
| dc.description.abstract | We analyse Kreisel's notion of human-effective computability. Like Kreisel, we relate this notion to a concept of informal provability, but we disagree with Kreisel about the precise way in which this is best done. The resulting two different ways of analysing human-effective computability give rise to two different variants of Church's thesis. These are both investigated by relating them to transfinite progressions of formal theories in the sense of Feferman. | eng |
| dc.description.version | published | eng |
| dc.identifier.doi | 10.1093/philmat/nky011 | eng |
| dc.identifier.uri | https://kops.uni-konstanz.de/handle/123456789/48649 | |
| dc.language.iso | eng | eng |
| dc.rights | terms-of-use | |
| dc.rights.uri | https://rightsstatements.org/page/InC/1.0/ | |
| dc.subject.ddc | 100 | eng |
| dc.title | Human-Effective Computability | eng |
| dc.type | JOURNAL_ARTICLE | eng |
| dspace.entity.type | Publication | |
| kops.citation.bibtex | @article{AntonuttiMarfori2019-02-01Human-48649,
year={2019},
doi={10.1093/philmat/nky011},
title={Human-Effective Computability},
number={1},
volume={27},
issn={0031-8019},
journal={Philosophia Mathematica},
pages={61--87},
author={Antonutti Marfori, Marianna and Horsten, Leon}
} | |
| kops.citation.iso690 | ANTONUTTI MARFORI, Marianna, Leon HORSTEN, 2019. Human-Effective Computability. In: Philosophia Mathematica. Oxford University Press (OUP). 2019, 27(1), pp. 61-87. ISSN 0031-8019. eISSN 1744-6406. Available under: doi: 10.1093/philmat/nky011 | deu |
| kops.citation.iso690 | ANTONUTTI MARFORI, Marianna, Leon HORSTEN, 2019. Human-Effective Computability. In: Philosophia Mathematica. Oxford University Press (OUP). 2019, 27(1), pp. 61-87. ISSN 0031-8019. eISSN 1744-6406. Available under: doi: 10.1093/philmat/nky011 | eng |
| kops.citation.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/48649">
<dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/40"/>
<dc:contributor>Antonutti Marfori, Marianna</dc:contributor>
<void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
<dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
<dc:contributor>Horsten, Leon</dc:contributor>
<dcterms:title>Human-Effective Computability</dcterms:title>
<dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2020-02-14T13:39:10Z</dcterms:available>
<dc:rights>terms-of-use</dc:rights>
<dc:creator>Antonutti Marfori, Marianna</dc:creator>
<dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2020-02-14T13:39:10Z</dc:date>
<dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/40"/>
<dcterms:issued>2019-02-01</dcterms:issued>
<bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/48649"/>
<dc:creator>Horsten, Leon</dc:creator>
<foaf:homepage rdf:resource="http://localhost:8080/"/>
<dc:language>eng</dc:language>
<dcterms:abstract xml:lang="eng">We analyse Kreisel's notion of human-effective computability. Like Kreisel, we relate this notion to a concept of informal provability, but we disagree with Kreisel about the precise way in which this is best done. The resulting two different ways of analysing human-effective computability give rise to two different variants of Church's thesis. These are both investigated by relating them to transfinite progressions of formal theories in the sense of Feferman.</dcterms:abstract>
</rdf:Description>
</rdf:RDF> | |
| kops.flag.isPeerReviewed | true | eng |
| kops.flag.knbibliography | true | |
| kops.sourcefield | Philosophia Mathematica. Oxford University Press (OUP). 2019, <b>27</b>(1), pp. 61-87. ISSN 0031-8019. eISSN 1744-6406. Available under: doi: 10.1093/philmat/nky011 | deu |
| kops.sourcefield.plain | Philosophia Mathematica. Oxford University Press (OUP). 2019, 27(1), pp. 61-87. ISSN 0031-8019. eISSN 1744-6406. Available under: doi: 10.1093/philmat/nky011 | deu |
| kops.sourcefield.plain | Philosophia Mathematica. Oxford University Press (OUP). 2019, 27(1), pp. 61-87. ISSN 0031-8019. eISSN 1744-6406. Available under: doi: 10.1093/philmat/nky011 | eng |
| relation.isAuthorOfPublication | 7a655380-a594-49b4-a5bb-d3a6adc1f18a | |
| relation.isAuthorOfPublication.latestForDiscovery | 7a655380-a594-49b4-a5bb-d3a6adc1f18a | |
| source.bibliographicInfo.fromPage | 61 | eng |
| source.bibliographicInfo.issue | 1 | eng |
| source.bibliographicInfo.toPage | 87 | eng |
| source.bibliographicInfo.volume | 27 | eng |
| source.identifier.eissn | 1744-6406 | eng |
| source.identifier.issn | 0031-8019 | eng |
| source.periodicalTitle | Philosophia Mathematica | eng |
| source.publisher | Oxford University Press (OUP) | eng |