DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ziegler, M | ko |
dc.date.accessioned | 2016-04-12T07:53:00Z | - |
dc.date.available | 2016-04-12T07:53:00Z | - |
dc.date.created | 2015-09-17 | - |
dc.date.created | 2015-09-17 | - |
dc.date.created | 2015-09-17 | - |
dc.date.issued | 2002 | - |
dc.identifier.citation | MATHEMATICAL LOGIC QUARTERLY, v.48, pp.157 - 181 | - |
dc.identifier.issn | 0942-5616 | - |
dc.identifier.uri | http://hdl.handle.net/10203/203406 | - |
dc.description.abstract | For the computability of subsets of real numbers, several reasonable notions have been suggested in the literature. We compare these notions in a systematic way by relating them to pairs of 'basic' ones. They turn out to coincide for full-dimensional convex sets, but on the more general class of regular sets, they reveal rather interesting 'weaker/stronger' relations. This is in contrast to single real numbers and vectors where all 'reasonable' notions coincide. | - |
dc.language | English | - |
dc.publisher | WILEY-V C H VERLAG GMBH | - |
dc.title | Computability on regular subsets of Euclidean space | - |
dc.type | Article | - |
dc.identifier.wosid | 000179220100014 | - |
dc.identifier.scopusid | 2-s2.0-0036433754 | - |
dc.type.rims | ART | - |
dc.citation.volume | 48 | - |
dc.citation.beginningpage | 157 | - |
dc.citation.endingpage | 181 | - |
dc.citation.publicationname | MATHEMATICAL LOGIC QUARTERLY | - |
dc.identifier.doi | 10.1002/1521-3870(200210)48:1+<157::AID-MALQ157>3.0.CO;2-4 | - |
dc.contributor.localauthor | Ziegler, M | - |
dc.type.journalArticle | Article; Proceedings Paper | - |
dc.subject.keywordAuthor | computability | - |
dc.subject.keywordAuthor | recursive analysis | - |
dc.subject.keywordAuthor | regular sets | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.