Showing papers presented at "Soft Computing in 1992"
10 Apr 1992
TL;DR: In this article, the extent to which certain connectedness concepts in FTS can be viewed as connectedness in Preuss' sense is examined, i.e., as subclasses of [FTS] which equal CE.
Abstract: the principal aim of this paper is to examine the extent to which certain connectedness concepts in FTS can be viewed as connectedness in Preuss' sense i.e., as subclasses of [FTS] which equal CE:= {X ϵ ∥FTS∥ ∥ ƒ ϵ FTS(X, Y), Y ϵ E ⇒ ƒ is constant}, for some E ⊂ ∥FTS∥. Two new connectedness concepts in FTS, which subsume an existing concept, are shown capable of being so viewed while it turns out that certain existing, otherwise good, connectedness concepts cannot be so viewed.