Definition:Main Connective/Propositional Logic/Definition 3
Jump to navigation
Jump to search
Definition
Let $T$ be a WFF of propositional logic in the labeled tree specification.
Suppose $T$ has more than one node.
Then the label of the root of $T$ is called the main connective of $T$.
Sources
- 1993: M. Ben-Ari: Mathematical Logic for Computer Science ... (previous) ... (next): Chapter $2$: Propositional Calculus: $\S 2.2$: Propositional formulas
- 2012: M. Ben-Ari: Mathematical Logic for Computer Science (3rd ed.) ... (previous) ... (next): $\S 2.1.4$: Definition $2.10$