Relative computability and uniform continuity of relations

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 332
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorPauly, Arnoko
dc.contributor.authorZiegler, Martin A.ko
dc.date.accessioned2016-04-12T07:51:11Z-
dc.date.available2016-04-12T07:51:11Z-
dc.date.created2015-09-18-
dc.date.created2015-09-18-
dc.date.issued2013-
dc.identifier.citationJournal of Logic and Analysis, v.5, no.7, pp.1 - 39-
dc.identifier.issn1759-9008-
dc.identifier.urihttp://hdl.handle.net/10203/203389-
dc.description.abstractWe are thus led to a concept of uniform continuity based on the Henkin quantifer and prove it necessary for relative computability of compact real relations. In fact iterating this condition yields a strict hierarchy of notions each necessary—and w-the level also sufficient— for relative computability. A refined, quantitative analysis exhibits a similar topological characterization of relative polynomialtime computability.-
dc.languageEnglish-
dc.publisherAssociation for Symbolic Logic-
dc.titleRelative computability and uniform continuity of relations-
dc.typeArticle-
dc.type.rimsART-
dc.citation.volume5-
dc.citation.issue7-
dc.citation.beginningpage1-
dc.citation.endingpage39-
dc.citation.publicationnameJournal of Logic and Analysis-
dc.identifier.doi10.4115/jla.2013.5.7-
dc.contributor.localauthorZiegler, Martin A.-
dc.contributor.nonIdAuthorPauly, Arno-
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0