Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-17T20:16:50.157Z Has data issue: false hasContentIssue false

Fully admissible binary relations in topology

Published online by Cambridge University Press:  24 October 2008

D. M. G. McSherry
Affiliation:
Queen's University, Belfast
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

A fully admissible binary relation (3) is an operator , other than the equality operator and universal operator , which assigns to each space |S, τ|, a reflexive, symmetric, binary relation , and which is such that for any continuous mapping implies . With each such relation , we associate a ‘separation axiom’ , as well as ‘-regularity’ and ‘-connectedness’, where ≡ -regularity + T0, and -regularity + -connectedness ≡ indiscreteness.

Information

Type
Research Article
Copyright
Copyright © Cambridge Philosophical Society 1977