Wyświetlanie pozycji 1-1 z 1

    • Covering functions by countably many functions from some families 

      Grande, Zbigniew (Springer Science + Business Media New York, 2013-10)
      Let A be a nonempty family of functions from R to R. A function f : R → R is said to be strongly countably A-function if there is a sequence (fn) of functions from A such that Gr(f) ⊂ n Gr(fn) (Gr(f) denotes the graph of ...