Chapter 12 Notes > Section 9 > Page 1173 > Note (c)

	Notes for: The Principle of Computational Equivalence | Implications for Mathematics and Its Foundations Notations [for logical primitives] Among those in current use are (highlighted ones are supported directly in Mathematica): The grouping of terms is normally inferred from precedence of operators (typically ordered ==, \[Not], \[Nand], \[And], \[Xor],\[Nor], \[Or], \[Implies]), or explicitly indicated by parentheses, function brackets, or sometimes nested underbars or dots. So-called Polish notation given second-to-last above avoids all explicit delimiters (see page 896). PAGE IMAGE RELATED LINKS Pages related to this note: 806, 807 All notes on this page: Multiway systems [and operator systems] Logic in languages Properties [of logical primitives] Notations [for logical primitives] Universal logical functions All notes for this section Downloadable programs for this page Downloadable images Search Forum for this page Post a comment NKS | Online FAQs

From Stephen Wolfram: A New Kind of Science [citation]