Show Summary Details

Page of

PRINTED FROM OXFORD REFERENCE (www.oxfordreference.com). (c) Copyright Oxford University Press, 2013. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single entry from a reference work in OR for personal use (for details see Privacy Policy and Legal Notice).

Subscriber: null; date: 21 June 2018

Character Set

Source:
A Dictionary of Computing

Character Set

The typefaces and characters used in the dictionary entries follow normal conventions for printing mathematical and technical texts (rather than the more rigorous styles used in some specialist computing texts).

The special characters shown in the table have been used to express specific logic, set theory, and mathematical operations; for further information, see relevant entry. Letters of the Greek alphabet also occur in some entries.

 AND operation, conjunction ∧. OR operation, disjunction ∨ + NOT operation, negation ′ ￢ ~ NAND operation | Δ‎ NOR operation ↓ ∇ For set S and/or set T: x is a member of S x ∈ S x is not a member of S x ∉ S S is a subset of T S ⊆ T S is a proper subset of T S ⊂ T complement of S S′~S S̄ union of S and T S ∪ T intersection of S and T S ∩ T Cartesian product of S and T S × T relation R function of x ƒ(x), etc. function ƒ from set X to set Y ƒ:X→Y inverse function ƒ−1 inverse relation R−1 sum, with limits integral, with limits ∫abdx elements of matrix A aij transpose of matrix A AT inverse of matrix A A−1 equivalence ↔ ≡ biconditional ↔ ≡ conditional → ⇒ general binary operation ° universal quantifier ∀ existential quantifier ∃ greater than > greater than or equal to ≥ less than < less than or equal to ≤ approx. equal to ≈ not equal to ≠ infinity ∞