In formal logic, the notation 'f: a → b' represents a function f that maps an element from set a to an element in set b. This concept is essential for understanding how functions operate, where each input from set a corresponds to a unique output in set b. Functions can be viewed as rules or relationships that define how elements of one set relate to elements of another.