Results 91 to 100 of about 107 (106)
Some of the next articles are maybe not open access.
Syntopogenous spaces with preorder. I (Convexity)
Acta Mathematica Hungarica, 1984The subject of the paper initiated by papers of \textit{D. C. J. Burgess} and \textit{M. Fitzpatrick} [Math. Proc. Camb. Phil. Soc. 80, 71-79 (1976; Zbl 0371.54002); ibid. 83, 19-24 (1978; Zbl 0389.54002) and ibid. 85, 445-448 (1979; Zbl 0455.54001)] is the investigation of types of convexities (modified by elementary operations) for preordered ...
openaire +2 more sources
2005
The usefulness of formalisms for the description and the analysis of reactive systems is closely related to the underlying notion of behavioral equivalence. Such an equivalence should formally identify behaviors that are informally indistinguishable from each other, and at the same time distinguish between behaviors that are informally different.
openaire +1 more source
The usefulness of formalisms for the description and the analysis of reactive systems is closely related to the underlying notion of behavioral equivalence. Such an equivalence should formally identify behaviors that are informally indistinguishable from each other, and at the same time distinguish between behaviors that are informally different.
openaire +1 more source
Preordered uniform Hjelmslev planes
Journal of Geometry, 1985A point P is said to be a neighbour of a point Q if P and Q are incident with two distinct lines m and \(\ell\) (in symbols \(P\sim Q)\). \(P\sim \ell\) means P is a neighbour of some point of \(\ell.\) Let \(\ell\) and m be two lines, and let \(U\) be a point such that \(UI\ell\), \(U\nsim m\) (for the symbol ''I'' and the other special notions see ...
openaire +2 more sources
Totally preordered function spaces
2003The totally preordered set in this chapter is a set g of functions g: X→ Y, where (X,A) is a measurable set and Y an arbitrary set. Section 8.2 gives definitions and notation.
openaire +1 more source
Generated preorders and equivalences
2002Summary: For any relation \(R\), we denote by \(R^*\) and \(R^\bullet\) the smallest preorder and equivalence containing \(R\), respectively. We establish some basic properties of the closures \(R^*\) and \(R^\bullet\). Moreover, we provide some new characterizations of equivalences in terms of generated preorders.
openaire +1 more source
Preorder Relations and Pseudoconvex Metrics
American Journal of Mathematics, 1975openaire +2 more sources
Duality relationships on preordered topological spaces: the case of maximal preorders
2001ISBN 88-88037-02 ...
CARDIN, Marta, FERRETTI, Paola
openaire +1 more source
On the Continuous Representation of Preorders
International Economic Review, 1977openaire +1 more source

