E.8. List of Symbolic Assertions and Norms
Not only the preciseness, but also the conciseness of the logical language is a major advantage, since it enables us to see the essential principles of a certain domain. To take advantage of this feature of logical symbolism, we include in this section the list of assertions and norms we have discussed in their symbolic forms:
Ownership and Priority
| A-(1) | ∀x (O(x) → prio(x) = 255) |
| A-(2) | ∀x (prio(x) = 255 → O(x)) |
| A-(3) | ∀x (O(x) ↔ prio(x) = 255) |
| A-(4) | ∀x (¬O(x) ↔ prio(x) ≠ 255) |
| A-(5) | ∀x ∀y[(O(x) ∧ O(y) )→ x = y] |
| A-(6) | ∀x ∀y[(prio(x) = 255 ∧ prio(y) = 255)→ x = y] |
| A-(7) | ∀x (∃y (O(y) ∧ y t x) → ¬∀z(prio(x) > prio(z) ) |
Backing up
| A-(8) | ∀x (∃yB(y, x) → O(x) ) |
| A-(9) | ∀x ∀y ∀z ∀w{ [B(x, y) ∧ B(w, z)] → y = z ... |
Get VRRP: Increasing Reliability and Failover with the Virtual Router Redundance Protocol now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
