1981
DOI: 10.1090/conm/003
|View full text |Cite
|
Sign up to set email alerts
|

The closed graph and P-closed graph properties in general topology

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
8
0

Year Published

1988
1988
1996
1996

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 13 publications
(8 citation statements)
references
References 0 publications
0
8
0
Order By: Relevance
“…A generalization and an analogue of theorem 5 of Piotrowski and Szymanski [3] and analogues of theorem 1.1.17 and corollary 1.1.18 of Hamlett and Herrington [4] are also obtained.…”
Section: Introductionmentioning
confidence: 72%
See 2 more Smart Citations
“…A generalization and an analogue of theorem 5 of Piotrowski and Szymanski [3] and analogues of theorem 1.1.17 and corollary 1.1.18 of Hamlett and Herrington [4] are also obtained.…”
Section: Introductionmentioning
confidence: 72%
“…The definitions of subcontinuous and inversely subcontinuous maps can be found in Fuller MAIN RESULTS. THEOREM [4] . PROOF.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…In [6] it is shown (for compact HausdorfF X and Hausdorff Y also in [13]) that a function / : X Y has a closed graph if and only if C(f, x) -{/(x)}, where C(f, x) is the cluster set of / at x defined by C(f, x) -Hi/gw CI /(?/) (= {y g Y : there.exists a net x a in X with limx a = x and lim/(z a ) = y}). Hence the following definition seems to be reasonable.…”
Section: Local Characterization Of Functions With Closed Graphsmentioning
confidence: 99%
“…It is known that if Y is compact [8], [6] or if X is first countable and Y is countably compact [9], [6] or if X is saturated and Y is regular countably compact [5], then functions with closed graphs are continuous. However, from their proofs it follows that under above assumptions on X and We recall that a topological space is almost resolvable if it is a countable union of sets with empty interiors.…”
Section: Proof We Have C(f) C H(f) Further If X E C(f) and K Is A mentioning
confidence: 99%