Equivalent formulas

From Maths
Revision as of 11:32, 11 September 2016 by Alec (Talk | contribs) (Created page with "{{Stub page|grade=B|msg=I'm not exactly sure how to lay this out, but this is based on page 32 in{{rMLFFISWL}}}} ==Statement/Definition== There's something in the second to la...")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search
Stub grade: B
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[1]

Statement/Definition

There's something in the second to last paragraph of page 32 in[1]

Examples

Recall [ilmath]\models A[/ilmath] denotes that a formula is valid.

  1. [ilmath]\models(A\wedge B)\leftrightarrow\neg(\neg A\vee \neg B)[/ilmath]
  2. [ilmath]\models(A\rightarrow B)\leftrightarrow\neg A\vee B[/ilmath] (see negation of implies)
  3. [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
  4. [ilmath]\models(\forall x A)\leftrightarrow\neg(\exists x\neg A)[/ilmath] (would be good one to prove!)

Proofs

Grade: B
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 et al).
The message provided is:
See page 32 in[1]

References

  1. 1.0 1.1 1.2 Mathematical Logic - Foundations for Information Science - Wei Li

Template:Formal logic navbox