The quantification of the topological features of binary trees has been applied in several branches of biology, from botany to neurobiology to animal behaviour. The methods available for quantifying tree topology differ, both in how they are applied and how they relate to one another. In this paper,
A Characterization of G. CHOQUET's Pseudo-Topologies
✍ Scribed by Sándor Gacsályi
- Publisher
- John Wiley and Sons
- Year
- 1968
- Tongue
- English
- Weight
- 431 KB
- Volume
- 37
- Category
- Article
- ISSN
- 0025-584X
No coin nor oath required. For personal study only.
✦ Synopsis
This is a direct continuation of the authors paper [4], to which we refer for t,he notions and notations employed. (See also [I, 21 and [3].) I n § 6 of [4] we have shown that every pseudo-topology in the sense of G. CHOQUET can be considered as a limiting, and hence also as a t-maximal filter of perfect topogenous orders. (Cf. [4], Theorem 3.) Once it is known that every pseudotopology can be regarded as a t-maximal filter of perfect topogenous orders, it is natural to ask for the condition which must be imposed upon a tmaximal filter in order that it may yield a pseudo-topology. This question was left open in [4], and it is the aim of the present note to supply an answer, i.e. to give a characterization of pseudo-topologies in terms of Tmaximal filters of perfect topogenous orders.
📜 SIMILAR VOLUMES
## Abstract The main purpose of this note is to characterize consistency of logic theories in propositional logic by means of topological concept. Based on the concepts of truth degree of formulas and similarity degree between formulas the concept of logic metric space has been proposed by the firs