Polish notation

related topics
{math, number, function}
{theory, work, human}
{language, word, form}
{work, book, publish}
{style, bgcolor, rowspan}

Polish notation, also known as prefix notation, is a form of notation for logic, arithmetic, and algebra. Its distinguishing feature is that it places operators to the left of their operands. If the arity of the operators is fixed, the result is a syntax lacking parentheses or other brackets, that can still be parsed without ambiguity. The Polish logician Jan Łukasiewicz invented this notation around 1920 in order to simplify sentential logic. When Polish notation is used as a syntax for mathematical expressions by interpreters of programming languages, it is readily parsed into abstract syntax trees and can, in fact, define a one-to-one representation for the same. Because of this, Lisp (see below) and related programming languages define their entire syntax in terms of prefix or postfix expressions.

Here is a quotation from a paper by Jan Łukasiewicz, Remarks on Nicod's Axiom and on "Generalizing Deduction", page 180.

"I came upon the idea of a parenthesis-free notation in 1924. I used that notation for the first time in my article Łukasiewicz(1), p. 610, footnote."

The reference cited by Jan Łukasiewicz above is apparently a lithographed report in Polish. The referring paper by Łukasiewicz Remarks on Nicod's Axiom and on "Generalizing Deduction" was reviewed by H. A. Pogorzelski in the Journal of Symbolic Logic in 1965.[1]

Alonzo Church mentions this notation in his classic book on Mathematical logic as worthy of remark in notational systems even contrasted to Whitehead and Russell's logical notational exposition and work in Principia Mathematica.[2]

In Łukasiewicz 1951 book, Aristotle’s Syllogistic from the Standpoint of Modern Formal Logic, he mentions that the principle of his notation was to write the functors before the arguments to avoid brackets and that he had employed his notation in his logical papers since 1929.[3] He then goes on to cite, as an example, a 1930 paper he wrote with Alfred Tarski on the sentential calculus.[4]

While no longer used much in logic, Polish notation has since found a place in computer science.

Contents

Full article ▸

related documents
Greatest common divisor
NP (complexity)
Empty set
Direct product
Binomial theorem
Tensor
Net (mathematics)
Affine transformation
Ordered pair
Graph theory
Partially ordered set
Knapsack problem
Grover's algorithm
Normal space
Fundamental theorem of arithmetic
Cyclic group
Selection sort
Topological vector space
B-spline
A* search algorithm
Delaunay triangulation
Pell's equation
Sheffer stroke
Banach space
Universal quantification
Befunge
Free group
Brute force attack
Finite state machine
Optimization (mathematics)