We study chains in an H-closed topological partially ordered space. We give sufficient conditions for a maximal chain L in an H-closed topological partially ordered space such that L contains a maximal (minimal) element. Also we give sufficient conditions for a linearly ordered topological partially ordered space to be H-closed. We prove that any H-closed topological semilattice contains a zero...

In this paper we find sufficient conditions on primitive inverse topological semigroup S under which: the inversion inv : (H(S)) (H(S)) is continuous; we show that every topologically periodic countable compact primitive inverse topological semigroups with closed H-classes is topologically isomorphic to an orthogonal sum P i2= Bi (Gi) of topological Brandt extensions Bi (Gi) of countably compac...

© Annales de l’institut Fourier, 1985, tous droits réservés. L’accès aux archives de la revue « Annales de l’institut Fourier » (http://annalif.ujf-grenoble.fr/) implique l’accord avec les conditions générales d’utilisation (http://www.numdam.org/legal.php). Toute utilisation commerciale ou impression systématique est constitutive d’une infraction pénale. Toute copie ou impression de ce fichier...

The cardinal functions of pseudocharacter, closed pseudocharacter, and character are used to examine H-closed spaces and to contrast the differences between Hclosed and minimal Hausdorff spaces. An H-closed space X is produced with the properties that |X| > 22 ψ(X) and ψ(X) > 2ψ(X).

We exhibit a canonical geometric pairing of the simple closed curves of the degree three cover of the modular surface, Γ\H , with the proper single self-intersecting geodesics of Crisp and Moran. This leads to a pairing of fundamental domains for Γ with Markoff triples. The routes of the simple closed geodesics are directly related to the above. We give two parametrizations of these. Combining ...

Let $ H$ be a Hilbert space and $C$ be a closed, convex and nonempty subset of $H$. Let $T:C rightarrow H$ be a non-self and non-expansive mapping. V. Colao and G. Marino with particular choice of the sequence  ${alpha_{n}}$ in Krasonselskii-Mann algorithm, ${x}_{n+1}={alpha}_{n}{x}_{n}+(1-{alpha}_{n})T({x}_{n}),$ proved both weak and strong converging results. In this paper, we generalize thei...

In 1977, G. Plotkin pointed out the problem of finding a fully abstract model for the sequential programming language PCF [16], which had been originally developed by D. Scott [19]. This question turned out to be one of the most enduring problems of semantics. A very nice description of the different approaches to this subject with many references can be found in [5]. In this rather brief overv...