This page is a stub
This page is a stub, so it contains little or minimal information and is on a to-do list
for being expanded.The message provided is:
I'm not exactly sure how to lay this out, but this is based on page 32 in
There's something in the second to last paragraph of page 32 in
Recall [ilmath]\models A[/ilmath] denotes that a formula is valid.
- [ilmath]\models(A\wedge B)\leftrightarrow\neg(\neg A\vee \neg B)[/ilmath]
- [ilmath]\models(A\rightarrow B)\leftrightarrow\neg A\vee B[/ilmath] (see negation of implies)
- [ilmath]\models(A\leftrightarrow B)\leftrightarrow\neg(\neg(\neg A\vee B)\vee\neg(\neg B\vee A))[/ilmath], not even sure I've written this down correctly, never used it
- [ilmath]\models(\forall x A)\leftrightarrow\neg(\exists x\neg A)[/ilmath] (would be good one to prove!)
This page requires one or more proofs to be filled in, it is on a to-do list
for being expanded with them.
Please note that this does not mean the content is unreliable. Unless there are any caveats mentioned below the statement comes from a reliable source. As always, Warnings and limitations will be clearly shown and possibly highlighted if very important (see template:Caution
The message provided is:
- ↑ 1.0 1.1 1.2 Mathematical Logic - Foundations for Information Science - Wei Li
Template:Formal logic navbox