Results 131 to 140 of about 416 (152)

Rewriting for preorder relations

1995
Preorders are often used as a semantic tool in various fields of computer science. Examples in this direction are the preorder semantics defined for process algebra formalisms, such as testing preorders and bisimulation preorders. Preorders turn out to be useful when modelling divergence or partial specification.
openaire   +4 more sources

Filtral Preorders and Opportunity Inequality

SSRN Electronic Journal, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Vannucci, Stefano, Savaglio, E.
openaire   +3 more sources

Preordered affine Hjelmslev planes

Journal of Geometry, 1984
Verf. nennen eine affine Hjelmslev-Ebene (AH-Ebene) \({\mathfrak H}=(P,{\mathfrak L})\) ''prägeordenet'', wenn auf P wie üblich eine ternäre Relation \(\rho\) erklärt ist, so daß die Einschränkung von \(\rho\) auf jede Gerade \(L\in {\mathfrak L}\) eine Zwischenrelation ist und \(\rho\) bei allen bijektiven Parallelperspektivitäten [\(A\to^{C}B ...
Baker, Catharine A., Lane, Norman D., Lorimer, Joseph W., Laxton, James A.   +3 more
openaire   +1 more source

How to Revise a Total Preorder

Journal of Philosophical Logic, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Booth, Richard, Meyer, Thomas
openaire   +1 more source

Totally preordered sets

2003
The central topic in this chapter is totally preordered sets. Section 2.2 gives conditions for the existence of order homomorphisms between totally preordered sets and subsets of the real numbers. Some topological concepts are introduced in section 2.3 page 18.
openaire   +1 more source

Topological Closure of Translation Invariant Preorders

Mathematics of Operations Research, 2014
Our primary query is to find conditions under which the closure of a preorder on a topological space remains transitive. We study this problem for translation invariant preorders on topological groups. The results are fairly positive; we find that the closure of preorders and normal orders remain as such in this context.
Ok, Efe A., Riella, Gil
openaire   +2 more sources

Syntopogenous spaces with preorder. I (Convexity)

Acta Mathematica Hungarica, 1984
The 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

5 Preorder Relations

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

Preordered uniform Hjelmslev planes

Journal of Geometry, 1985
A 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

2003
The 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