Abstract
This paper is devoted to the study of various completions of posets which preserve the algebraic or ordering structure of the given poset.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
ADJ, A uniform approach to inductive posets and inductive closure, MFCS 77, Lect. Notes Comp. Sc. no 53, Springer-Verlag (1977), 192–212
G. BIRKHOFF, Lattice theory, 3rd ed., New York (1967)
S. BLOOM, Varieties of ordered algebras, JCSS 13 (1976), 200–212
B. COURCELLE, J.C. RAOULT, Completions de magmas ordonnés, to appear
I. GUESSARIAN, Semantic equivalence of program schemes and its syntactic characterization, Proc. 3rd ICALP, Edinburgh (1976), 189–200
I. GUESSARIAN, Les tests et leur caractérisation syntaxique, RAIRO 11 (1977), 133–156
K. INDERMARK, Schemes with recursion on higher types, MFCS 76, Lect. Notes Comp. Sc. no45, Springer-Verlag (1976), 352–358
J. MESEGUER, Factorizations, completions and colimits for w-posets, extended abstract (1978), to appear
J. MESEGUER, Ideal monads and Z-posets, Not. Am. Math. Soc. 25 no6(1978), 579–580
M. NIVAT, On the interpretation of recursive polyadic program schemes, Symposia Mathematica 15, Rome (1975), 256–281
M. NIVAT, Interprétation universelle d'un schéma de programme récursif, Rivista di informatica 7 (1977), 9–16
Editor information
Rights and permissions
Copyright information
© 1979 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guessarian, I. (1979). On continuous completions. In: Weihrauch, K. (eds) Theoretical Computer Science 4th GI Conference. Lecture Notes in Computer Science, vol 67. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09118-1_16
Download citation
DOI: https://doi.org/10.1007/3-540-09118-1_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09118-9
Online ISBN: 978-3-540-35517-5
eBook Packages: Springer Book Archive