On the algebra of order

Daniel J. Lehmann

doi:10.1016/0022-0000(80)90038-0

On the algebra of order

Daniel J. Lehmann^*

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Contribution to journal › Article › peer-review

7 Scopus citations

Abstract

An abstract characterization of some constructions relating to ordered and complete algebras is given. In particular the completion of a poset and the initial objects of semi-varieties of (complete) ordered algebras are studied. The quotient construction allows a reconciliation of the equational and synthetic (order-theoretic) approaches to abstract data types.

Original language	English
Pages (from-to)	1-23
Number of pages	23
Journal	Journal of Computer and System Sciences
Volume	21
Issue number	1
DOIs	https://doi.org/10.1016/0022-0000(80)90038-0
State	Published - 1980

Access to Document

10.1016/0022-0000(80)90038-0

Cite this

@article{e8aa55a18724448bb4563187f3adb5a9,

title = "On the algebra of order",

abstract = "An abstract characterization of some constructions relating to ordered and complete algebras is given. In particular the completion of a poset and the initial objects of semi-varieties of (complete) ordered algebras are studied. The quotient construction allows a reconciliation of the equational and synthetic (order-theoretic) approaches to abstract data types.",

author = "Lehmann, \{Daniel J.\}",

year = "1980",

doi = "10.1016/0022-0000(80)90038-0",

language = "אנגלית",

volume = "21",

pages = "1--23",

journal = "Journal of Computer and System Sciences",

issn = "0022-0000",

publisher = "Academic Press Inc.",

number = "1",

}

TY - JOUR

T1 - On the algebra of order

AU - Lehmann, Daniel J.

PY - 1980

Y1 - 1980

N2 - An abstract characterization of some constructions relating to ordered and complete algebras is given. In particular the completion of a poset and the initial objects of semi-varieties of (complete) ordered algebras are studied. The quotient construction allows a reconciliation of the equational and synthetic (order-theoretic) approaches to abstract data types.

AB - An abstract characterization of some constructions relating to ordered and complete algebras is given. In particular the completion of a poset and the initial objects of semi-varieties of (complete) ordered algebras are studied. The quotient construction allows a reconciliation of the equational and synthetic (order-theoretic) approaches to abstract data types.

UR - https://www.scopus.com/pages/publications/84890898177

U2 - 10.1016/0022-0000(80)90038-0

DO - 10.1016/0022-0000(80)90038-0

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84890898177

SN - 0022-0000

VL - 21

SP - 1

EP - 23

JO - Journal of Computer and System Sciences

JF - Journal of Computer and System Sciences

IS - 1

ER -

On the algebra of order

Abstract

Access to Document

Other files and links

Fingerprint

Cite this