Topics

No keywords indexed for this article. Browse by subject →

References
10
[2]
Tensor Products and Bimorphisms

Bernhard Banaschewski, Evelyn Nelson

Canadian Mathematical Bulletin 10.4153/cmb-1976-060-2
[4]
Herrlich H. (1968) 10.1007/bfb0074312
[5]
Herrlich H. (1973)
[7]
Categories of chain-complete posets

George Markowsky

Theoretical Computer Science 10.1016/0304-3975(77)90031-7
Cited By
20
Applied Categorical Structures
Metrics
20
Citations
10
References
Details
Published
Aug 01, 1982
Vol/Issue
11(3)
Pages
521-528
Cite This Article
Bernhard Banaschewski, Evelyn Nelson (1982). Completions of Partially Ordered Sets. SIAM Journal on Computing, 11(3), 521-528. https://doi.org/10.1137/0211041
Related

You May Also Like

Depth-First Search and Linear Graph Algorithms

Robert Tarjan · 1972

4,499 citations

The Knowledge Complexity of Interactive Proof Systems

Shafi Goldwasser, Silvio Micali · 1989

2,063 citations

Sparse Approximate Solutions to Linear Systems

B. K. Natarajan · 1995

1,969 citations

Fast Pattern Matching in Strings

Donald E. Knuth, James H. Morris, Jr. · 1977

1,950 citations