Category:Labeled Trees for Propositional Logic

This category contains results about Labeled Trees for Propositional Logic.
Definitions specific to this category can be found in Definitions/Labeled Trees for Propositional Logic.

A labeled tree for propositional logic is a system containing:

• A rooted tree $T$;
• A countable set $\mathbf H$ of WFFs of propositional logic;
• A WFF $\map \Phi t$ attached to each non-root node $t$ of $T$.

Such a structure can be denoted $\struct {T, \mathbf H, \Phi}$.