A direct characterization of completion

DOI10.1016/0304-3975(95)00088-7zbMath0872.68105OpenAlexW1985630949MaRDI QIDQ672756

Juan-Miguel Gracia

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00088-7

zbMATH Keywords

completed posetcpofully abstract semantic models

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Continuous lattices and posets, applications (06B35)

Related Items (1)

A uniform approach to completions of posets

Cites Work

• Recent Contributions to the Ergodic Theory
• Unnamed Item
• Unnamed Item

This page was built for publication: A direct characterization of completion