Optimal Results on Recognizability for Infinite Time Register Machines
| Type of Publication: | Journal article |
| Publication status: | Published |
| URI (citable link): | http://nbn-resolving.de/urn:nbn:de:bsz:352-0-319905 |
| Author: | Carl, Merlin |
| Year of publication: | 2015 |
| Published in: | The Journal of Symbolic Logic ; 80 (2015), 4. - pp. 1116-1130. - ISSN 0022-4812. - eISSN 1943-5886 |
| DOI (citable link): | https://dx.doi.org/10.1017/jsl.2015.8 |
| Subject (DDC): | 510 Mathematics |
| Keywords: | Infinite Time Computability, Generalized Computability, Infinite Time Register Machines, Recognizable Reals |
| Link to License: | In Copyright |
| Bibliography of Konstanz: | Yes |
| xmlui.ArtifactBrowser.ItemViewer.detail.textAllianzLicense | |
Cite This
Files in this item
![[PDF]](/themes/Kops/images/mimes/pdf.png "PDF file"){kind=small}
CARL, Merlin, 2015. Optimal Results on Recognizability for Infinite Time Register Machines. In: The Journal of Symbolic Logic. 80(4), pp. 1116-1130. ISSN 0022-4812. eISSN 1943-5886. Available under: doi: 10.1017/jsl.2015.8
@article{Carl2015Optim-33377, title={Optimal Results on Recognizability for Infinite Time Register Machines}, year={2015}, doi={10.1017/jsl.2015.8}, number={4}, volume={80}, issn={0022-4812}, journal={The Journal of Symbolic Logic}, pages={1116--1130}, 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/33377"> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/39"/> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2016-03-18T13:57:33Z</dcterms:available> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2016-03-18T13:57:33Z</dc:date> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:creator>Carl, Merlin</dc:creator> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/33377"/> <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/> <dc:language>eng</dc:language> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/39"/> <dc:rights>terms-of-use</dc:rights> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/33377/1/Carl_0-319905.pdf"/> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/33377/1/Carl_0-319905.pdf"/> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:contributor>Carl, Merlin</dc:contributor> <dcterms:issued>2015</dcterms:issued> <dcterms:title>Optimal Results on Recognizability for Infinite Time Register Machines</dcterms:title> </rdf:Description> </rdf:RDF>
Downloads since Mar 18, 2016 (Information about access statistics)
| Carl_0-319905.pdf | 188 |
This item appears in the following Collection(s)
Search KOPS
Browse
My Account
