<--- Back to Details
First PageDocument Content
Metrization theorem / Topological property / Compact space / Separable space / Countably compact space / Locally compact space / Continuous function / Baire space / Paracompact space / Topology / General topology / Lindelöf space
Date: 2009-11-20 18:26:57
Metrization theorem
Topological property
Compact space
Separable space
Countably compact space
Locally compact space
Continuous function
Baire space
Paracompact space
Topology
General topology
Lindelöf space

140 c-16

Add to Reading List

Source URL: e-books.enigma.uran.ru

Download Document from Source Website

File Size: 126,58 KB

Share Document on Facebook

Similar Documents

Formal Baire space in constructive set theory Giovanni Curi and Michael Rathjen∗ Dipartimento di Matematica, Universit`a di Padova Via Trieste, Padova, Italy  (G. Curi). Department of Pure M

Formal Baire space in constructive set theory Giovanni Curi and Michael Rathjen∗ Dipartimento di Matematica, Universit`a di Padova Via Trieste, Padova, Italy (G. Curi). Department of Pure M

DocID: 1mHHB - View Document

CONSISTENCY OF A STRONG UNIFORMIZATION PRINCIPLE PAUL LARSON AND SAHARON SHELAH Abstract. We prove the consistency of a strong uniformization principle for a subset of the Baire space of cardinality ℵ1 . As a consequen

CONSISTENCY OF A STRONG UNIFORMIZATION PRINCIPLE PAUL LARSON AND SAHARON SHELAH Abstract. We prove the consistency of a strong uniformization principle for a subset of the Baire space of cardinality ℵ1 . As a consequen

DocID: 1gHXX - View Document

Problem 50 (Banach). Prove that the integral of Denjoy is not a Baire functional in the space S (that is to say, in the space of measurable functions). Commentary The formulation of this problem is rather vague. However

Problem 50 (Banach). Prove that the integral of Denjoy is not a Baire functional in the space S (that is to say, in the space of measurable functions). Commentary The formulation of this problem is rather vague. However

DocID: 1gDAP - View Document

Computable Real Analysis without Set Theory or Turing Machines Paul Taylor Department of Computer Science University of Manchester UK EPSRC GR/S58522

Computable Real Analysis without Set Theory or Turing Machines Paul Taylor Department of Computer Science University of Manchester UK EPSRC GR/S58522

DocID: 1fwpH - View Document

Topics in Analysis Examples Sheet 4  W. T. G. 1. (i) For each n let Fn be the nth Fibonacci number, with F1 = F2 = 1. Prove the 2

Topics in Analysis Examples Sheet 4 W. T. G. 1. (i) For each n let Fn be the nth Fibonacci number, with F1 = F2 = 1. Prove the 2

DocID: 19mp5 - View Document