Hierarchies of function classes defined by the first-value operator

Armin Hemmerling

RAIRO - Theoretical Informatics and Applications (2007)

  • Volume: 42, Issue: 2, page 253-270
  • ISSN: 0988-3754

Abstract

top
The first-value operator assigns to any sequence of partial functions of the same type a new such function. Its domain is the union of the domains of the sequence functions, and its value at any point is just the value of the first function in the sequence which is defined at that point. In this paper, the first-value operator is applied to establish hierarchies of classes of functions under various settings. For effective sequences of computable discrete functions, we obtain a hierarchy connected with Ershov's one within Δ 2 0 . The non-effective version over real functions is connected with the degrees of discontinuity and yields a hierarchy related to Hausdorff's difference hierarchy in the Borel class  Δ 2 B . Finally, the effective version over approximately computable real functions forms a hierarchy which provides a useful tool in computable analysis.

How to cite

top

Hemmerling, Armin. "Hierarchies of function classes defined by the first-value operator." RAIRO - Theoretical Informatics and Applications 42.2 (2007): 253-270. <http://eudml.org/doc/92870>.

@article{Hemmerling2007,
abstract = { The first-value operator assigns to any sequence of partial functions of the same type a new such function. Its domain is the union of the domains of the sequence functions, and its value at any point is just the value of the first function in the sequence which is defined at that point. In this paper, the first-value operator is applied to establish hierarchies of classes of functions under various settings. For effective sequences of computable discrete functions, we obtain a hierarchy connected with Ershov's one within $\Delta^\{0\}_2$. The non-effective version over real functions is connected with the degrees of discontinuity and yields a hierarchy related to Hausdorff's difference hierarchy in the Borel class $\Delta^\{B\}_2$. Finally, the effective version over approximately computable real functions forms a hierarchy which provides a useful tool in computable analysis. },
author = {Hemmerling, Armin},
journal = {RAIRO - Theoretical Informatics and Applications},
keywords = {Hierarchies of functions; degree of discontinuity; computable analysis; effective descriptive set theory; Hausdorff hierarchy; Ershov hierarchy; hierarchies of functions},
language = {eng},
month = {12},
number = {2},
pages = {253-270},
publisher = {EDP Sciences},
title = {Hierarchies of function classes defined by the first-value operator},
url = {http://eudml.org/doc/92870},
volume = {42},
year = {2007},
}

TY - JOUR
AU - Hemmerling, Armin
TI - Hierarchies of function classes defined by the first-value operator
JO - RAIRO - Theoretical Informatics and Applications
DA - 2007/12//
PB - EDP Sciences
VL - 42
IS - 2
SP - 253
EP - 270
AB - The first-value operator assigns to any sequence of partial functions of the same type a new such function. Its domain is the union of the domains of the sequence functions, and its value at any point is just the value of the first function in the sequence which is defined at that point. In this paper, the first-value operator is applied to establish hierarchies of classes of functions under various settings. For effective sequences of computable discrete functions, we obtain a hierarchy connected with Ershov's one within $\Delta^{0}_2$. The non-effective version over real functions is connected with the degrees of discontinuity and yields a hierarchy related to Hausdorff's difference hierarchy in the Borel class $\Delta^{B}_2$. Finally, the effective version over approximately computable real functions forms a hierarchy which provides a useful tool in computable analysis.
LA - eng
KW - Hierarchies of functions; degree of discontinuity; computable analysis; effective descriptive set theory; Hausdorff hierarchy; Ershov hierarchy; hierarchies of functions
UR - http://eudml.org/doc/92870
ER -

References

top
  1. V. Brattka, Effective Borel measurability and reducibility of functions. Math. Logic Quart.51 (2005) 19–44.  
  2. R. Engelking, General topology. Heldermann Verlag, Berlin (1989).  
  3. R.L. Epstein, R. Haas and R.L. Kramer, Hierarchies of sets and degrees below 0', in Logic Year 1979/80, Univ. of Connecticut, edited by M. Lerman, J.H. Schmerl and R.I. Soare. Lect. Notes Math.859 32–48.  
  4. Yu. L. Ershov, A hierarchy of sets. I; II; III. Algebra Logica 7 (1968) 15–47. Algebra Logica 7 (1968) 47–74. Algebra Logica 9 (1970) 34–51 (English translation by Plenum P.C.).  
  5. F. Hausdorff, Grundzüge der Mengenlehre. W. de Gruyter & Co., Berlin and Leipzig (1914); Reprint: Chelsea P.C., New York (1949).  
  6. F. Hausdorff, Mengenlehre. W. de Gruyter & Co., Berlin and Leipzig (1927).  
  7. A. Hemmerling, Approximate decidability in Euclidean spaces. Math. Logic Quart.49 (2003) 34–56.  
  8. A. Hemmerling, Characterizations of the class Δ 2 t a over Euclidean spaces. Math. Logic Quart.50 (2004) 507–519.  
  9. A. Hemmerling, The Hausdorff-Ershov hierarchy in Euclidean spaces. Arch. Math. Logic45 (2006) 323–350.  
  10. P. Hertling, Unstetigkeitsgrade von Funktionen in der effektiven Analysis. Dissertation. Informatik Berichte 208-11/1996, Fern-Uni Hagen (1996).  
  11. P. Hertling, Topological complexity with continuous operations. J. Complexity12 (1996) 315–338.  
  12. P. Hertling and K. Weihrauch, Levels of degeneracy and exact lower complexity bounds for geometric algorithms, in Proc. of the 6th Canadian Conf. on Computational Geometry, Saskatoon (1994) 237–242.  
  13. A.S. Kechris, Classical descriptive set theory. Springer Verlag, New York (1995).  
  14. K.-I. Ko, Complexity theory of real functions. Birkhäuser, Boston (1991).  
  15. K.-I. Ko and H. Friedman, Computational complexity of real functions. Theoret. Comput. Sci.20 (1982) 323–352.  
  16. C. Kreitz and K. Weihrauch, Complexity theory on real numbers and functions. Lect. Notes. Comput. Sci.145 (1982) 165–174.  
  17. Y.N. Moschovakis, Descriptive set theory. North-Holland, Amsterdam (1980).  
  18. P. Odifreddi, Classical recursion theory. North–Holland, Amsterdam (1989).  
  19. H. Rogers Jr., Theory of recursive functions and effective computability. McGraw-Hill, New York (1967).  
  20. V.L. Selivanov, Wadge degrees of ω-languages of deterministic Turing machines. RAIRO-Theor. Inf. Appl.37 (2003) 67–84.  
  21. R.I. Soare, Recursively enumerable sets and degrees. Springer-Verlag, Berlin (1987).  
  22. K. Weihrauch, Computable analysis. Springer-Verlag, Berlin (2000).  

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.