Category:Definitions/Provable Consequences
Jump to navigation
Jump to search
This category contains definitions related to Provable Consequences.
Related results can be found in Category:Provable Consequences.
Let $\mathscr P$ be a proof system for a formal language $\LL$.
Let $\FF$ be a collection of WFFs of $\LL$.
Denote with $\map {\mathscr P} \FF$ the proof system obtained from $\mathscr P$ by adding all the WFFs from $\FF$ as axioms.
Let $\phi$ be a theorem of $\map {\mathscr P} \FF$.
Then $\phi$ is called a provable consequence of $\FF$, and this is denoted as:
- $\FF \vdash_{\mathscr P} \phi$
Note in particular that for $\FF = \O$, this notation agrees with the notation for a $\mathscr P$-theorem:
- $\vdash_{\mathscr P} \phi$
Pages in category "Definitions/Provable Consequences"
The following 3 pages are in this category, out of 3 total.