Abstract | ||
---|---|---|
Algebras whose carriers are partially ordered sets and operations are monotone and algebras whose carriers are complete partial orders and operations are continuous are studied. A quotient construction is provided for both types of algebras. The notion of a variety of algebras is defined and it is shown that the analogue of Birkhoff variety theorem holds for ordered algebras but not for continuous algebras. The results presented are a good first step towards a theory of ordered data types and a study of families of interpretations of schemas. |
Year | DOI | Venue |
---|---|---|
1978 | 10.1109/SFCS.1978.28 | FOCS |
Keywords | Field | DocType |
casting,upper bound,application software,ducts,flowcharts,data type,computer languages,games,construction,terminology,partial order,algebra,computer science,partially ordered set,iso,generators,differential equations | Non-associative algebra,Nest algebra,Jordan algebra,Variety (universal algebra),Interior algebra,Discrete mathematics,Combinatorics,Algebra,Cayley–Dickson construction,Quadratic algebra,Pure mathematics,Partially ordered set,Mathematics | Conference |
Citations | PageRank | References |
1 | 0.44 | 5 |
Authors | ||
1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Daniel J. Lehmann | 1 | 1270 | 330.79 |