brozek/website
1
0
Fork 0
mirror of https://github.com/Brandon-Rozek/website.git synced 2024-11-22 08:16:29 -05:00
Code Issues Projects Releases Packages Wiki Activity

Added a definition to a post

Browse source
This commit is contained in:
Brandon Rozek 2021-12-15 14:10:07 -05:00
parent ceedd3a003
commit 209995c77b
1 changed files with 1 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

1
content/blog/proofdef.md
View file

@ -13,6 +13,7 @@ When I look into a new field, sometimes I get confused by the whole new set of v
| Modus Ponens | If $P$ implies $Q$ and $P$ is asserted to be true, then $Q$ must be true. | | Modus Ponens | If $P$ implies $Q$ and $P$ is asserted to be true, then $Q$ must be true. |
| Complete | If every formula having the property can be derived using the system. (i.e The system does not miss a result) | | Complete | If every formula having the property can be derived using the system. (i.e The system does not miss a result) |
| Negation-Complete | Either $\phi$ or $\neg \phi$ can be proved in the system. | | Negation-Complete | Either $\phi$ or $\neg \phi$ can be proved in the system. |
| Consistent | For any provable formula $\phi$, the negation ($\neg \phi$) cannot be provable. (Cannot derive a contradiction) |
| Decidable | An effective method exists for deriving the correct answer in a finite time. | | Decidable | An effective method exists for deriving the correct answer in a finite time. |
| Sound | Every formula that can be proved in the system is logically valid with respect to the semantics of the system. (i.e The system does not produce a wrong result) | | Sound | Every formula that can be proved in the system is logically valid with respect to the semantics of the system. (i.e The system does not produce a wrong result) |