Jump to navigation Jump to search
As such, it is a formal grammar for $\mathcal L$.
- The letters:
<word> ::= <word-1> <word-2> ... <word-n>
<word> ::= <word-1> | <word-2> | ... | <word-n>
Terminals and Non-Terminals
Also known as
Although Peter Naur would prefer it kept its old name, the current name is prevalent.
Source of Name
- 1993: M. Ben-Ari: Mathematical Logic for Computer Science (1st ed.) ... (previous) ... (next): $\S 2.2$: Propositional formulas
- 2000: Michael R.A. Huth and Mark D. Ryan: Logic in Computer Science: Modelling and reasoning about systems ... (previous) ... (next): $\S 1.3$: Propositional logic as a formal language