Name
Title | ||
|---|---|---|
A Finite Basis of the Set of All Monotone Partial Functions Defined over a Finite Poset |
Abstract | ||
|---|---|---|
Let X be an arbitrary poser. A partial function f with n variables defined over X is said to be monotone if the following condition is satisfied: if x(1) less than or equal to y(1), ..., x(n) less than or equal to y(n), and both the values f(x(1), ..., x(n)) and f(y(1), ..., y(n)) are defined, then f(x(1), ..., x(n)) less than or equal to f(y(1), ..., y(n)), It is shown that the set of all monotone partial functions has a finite basis. |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1109/ISMVL.1998.679518 | ISMVL |
Keywords | Field | DocType |
monotone partial,finite poset,finite basis,formal logic,satisfiability,partial function,set theory,computer science | Set theory,Discrete mathematics,Combinatorics,Monotone polygon,Partial function,Partially ordered set,Mathematics | Conference |
ISSN | ISBN | Citations |
0195-623X | 0-8186-8371-6 | 3 |
PageRank | References | Authors |
0.83 | 1 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| A. Nozaki | 1 | 6 | 4.80 |
| V. Lashkia | 2 | 8 | 1.83 |