Topologies sur des espaces ordonnés

J. Betrema

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1982)

  • Volume: 16, Issue: 2, page 165-182
  • ISSN: 0988-3754

How to cite

top

Betrema, J.. "Topologies sur des espaces ordonnés." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 16.2 (1982): 165-182. <http://eudml.org/doc/92158>.

@article{Betrema1982,
author = {Betrema, J.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {left topology on partially ordered set; weakly continuous functions},
language = {fre},
number = {2},
pages = {165-182},
publisher = {EDP-Sciences},
title = {Topologies sur des espaces ordonnés},
url = {http://eudml.org/doc/92158},
volume = {16},
year = {1982},
}

TY - JOUR
AU - Betrema, J.
TI - Topologies sur des espaces ordonnés
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1982
PB - EDP-Sciences
VL - 16
IS - 2
SP - 165
EP - 182
LA - fre
KW - left topology on partially ordered set; weakly continuous functions
UR - http://eudml.org/doc/92158
ER -

References

top
  1. 1. A. ARNOLD et M. NIVAT, The Metric Space of Infinite Trees : Algebraïc and Topological Properties, Fundamenta Informaticae, vol. 4, 1980, p. 445-476. Zbl0453.68021MR604273
  2. 2. G. BIRKHOFF, Lattice Theory, American Mathematical Society, Providence, Rhode Island, 1967. Zbl0153.02501MR227053
  3. 3. S. L. BLOOM et R. TINDEL, Compatible Orderings on the Metric Theory of Trees in Les Arbres en Algèbre et en Programmation, 4e colloque, Lille, 1979, p. 18-23. MR554337
  4. 4. J. L. KELLEY, General Topology, Springer-Verlag, New York, Heidelberg, Berlin, 1955. Zbl0306.54002MR70144
  5. 5. J. MYCIELSKI et W. TAYLOR, A Compactification of the Algebra of Terms, Algebra Universalis, vol. 6, 1976, p. 159-163. Zbl0358.08001MR434922
  6. 6. M. NIVAT, On the Interpretation of Recursive Polyadic Program Schemes, Symposia Mathematica, vol. 15, 1975, p. 255-281. Zbl0346.68041MR391563
  7. 7. M. NIVAT, Sur les ensembles de mots infinis engendrés par une grammaire algébrique, R.A.I.R.O. Informatique théorique, vol. 12, 1978, p. 259 à 278. Zbl0387.68050MR510641
  8. 8. G. D. PLOTKIN, A Powerdomain Construction, S.I.A.M. J. on Computing, vol. 5, 1976, p. 452-487. Zbl0355.68015MR445891
  9. 9. D. SCOTT, The Lattice of Flow-Diagrams, in ENGELER, éd., Symposim on Semantics of Algorithmic Languages, Lecture Notes in Mathematics 188, Springer-Verlag, Berlin, Heidelberg, New York, 1971p. 311-372. Zbl0228.68016MR275724
  10. 10. D. SCOTT, Data Types as Lattices, S.I.A.M. J. on Computing, vol. 5, 1976, p. 522-587. Zbl0337.02018MR437330

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.