Category:Definitions/Labeled Trees for Propositional Logic
Jump to navigation
Jump to search
This category contains definitions related to Labeled Trees for Propositional Logic.
Related results can be found in Category: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}$.
Pages in category "Definitions/Labeled Trees for Propositional Logic"
The following 12 pages are in this category, out of 12 total.
L
- Definition:Labeled Tree for Propositional Logic
- Definition:Labeled Tree for Propositional Logic/Along a Branch
- Definition:Labeled Tree for Propositional Logic/Ancestor WFF
- Definition:Labeled Tree for Propositional Logic/Attached
- Definition:Labeled Tree for Propositional Logic/Child WFF
- Definition:Labeled Tree for Propositional Logic/Hypothesis Set