(computer science) A notation system for digital-computer or calculator logic in which there are no parenthetical expressions and each operator is a binary or unary operator in the sense that it operates on not more than two operands. Also known as Lukasiewicz notation; parenthesis-free notation. The version of this notation in which operators precede the operands with which they are associated. Also known as prefix notation.




