Definition:Labeled Tree for Propositional Logic/Child WFF
Jump to navigation
Jump to search
Definition
Let $\struct {T, \mathbf H, \Phi}$ be a labeled tree for propositional logic.
A WFF that is attached to a child of a node $t$ is called a child WFF of $t$.
Also known as
A child WFF of $t$ is also referred as just a child of $t$.
When using the term child in this way, take care to avoid confusion with the concept of child node.
Sources
- 1996: H. Jerome Keisler and Joel Robbin: Mathematical Logic and Computability ... (previous) ... (next): $\S 1.7$: Tableaus