Промежуточные таблицы истинности:A|B:
(A|B)∧D:
| A | B | D | A|B | (A|B)∧D |
| 0 | 0 | 0 | 1 | 0 |
| 0 | 0 | 1 | 1 | 1 |
| 0 | 1 | 0 | 1 | 0 |
| 0 | 1 | 1 | 1 | 1 |
| 1 | 0 | 0 | 1 | 0 |
| 1 | 0 | 1 | 1 | 1 |
| 1 | 1 | 0 | 0 | 0 |
| 1 | 1 | 1 | 0 | 0 |
A|C:
B|C:
A∧(B|C):
| A | B | C | B|C | A∧(B|C) |
| 0 | 0 | 0 | 1 | 0 |
| 0 | 0 | 1 | 1 | 0 |
| 0 | 1 | 0 | 1 | 0 |
| 0 | 1 | 1 | 0 | 0 |
| 1 | 0 | 0 | 1 | 1 |
| 1 | 0 | 1 | 1 | 1 |
| 1 | 1 | 0 | 1 | 1 |
| 1 | 1 | 1 | 0 | 0 |
A|D:
(B|C)|D:
| B | C | D | B|C | (B|C)|D |
| 0 | 0 | 0 | 1 | 1 |
| 0 | 0 | 1 | 1 | 0 |
| 0 | 1 | 0 | 1 | 1 |
| 0 | 1 | 1 | 1 | 0 |
| 1 | 0 | 0 | 1 | 1 |
| 1 | 0 | 1 | 1 | 0 |
| 1 | 1 | 0 | 0 | 1 |
| 1 | 1 | 1 | 0 | 1 |
((A|B)∧D)|(A|C):
| A | B | D | C | A|B | (A|B)∧D | A|C | ((A|B)∧D)|(A|C) |
| 0 | 0 | 0 | 0 | 1 | 0 | 1 | 1 |
| 0 | 0 | 0 | 1 | 1 | 0 | 1 | 1 |
| 0 | 0 | 1 | 0 | 1 | 1 | 1 | 0 |
| 0 | 0 | 1 | 1 | 1 | 1 | 1 | 0 |
| 0 | 1 | 0 | 0 | 1 | 0 | 1 | 1 |
| 0 | 1 | 0 | 1 | 1 | 0 | 1 | 1 |
| 0 | 1 | 1 | 0 | 1 | 1 | 1 | 0 |
| 0 | 1 | 1 | 1 | 1 | 1 | 1 | 0 |
| 1 | 0 | 0 | 0 | 1 | 0 | 1 | 1 |
| 1 | 0 | 0 | 1 | 1 | 0 | 0 | 1 |
| 1 | 0 | 1 | 0 | 1 | 1 | 1 | 0 |
| 1 | 0 | 1 | 1 | 1 | 1 | 0 | 1 |
| 1 | 1 | 0 | 0 | 0 | 0 | 1 | 1 |
| 1 | 1 | 0 | 1 | 0 | 0 | 0 | 1 |
| 1 | 1 | 1 | 0 | 0 | 0 | 1 | 1 |
| 1 | 1 | 1 | 1 | 0 | 0 | 0 | 1 |
(A∧(B|C))|(A|D):
| A | B | C | D | B|C | A∧(B|C) | A|D | (A∧(B|C))|(A|D) |
| 0 | 0 | 0 | 0 | 1 | 0 | 1 | 1 |
| 0 | 0 | 0 | 1 | 1 | 0 | 1 | 1 |
| 0 | 0 | 1 | 0 | 1 | 0 | 1 | 1 |
| 0 | 0 | 1 | 1 | 1 | 0 | 1 | 1 |
| 0 | 1 | 0 | 0 | 1 | 0 | 1 | 1 |
| 0 | 1 | 0 | 1 | 1 | 0 | 1 | 1 |
| 0 | 1 | 1 | 0 | 0 | 0 | 1 | 1 |
| 0 | 1 | 1 | 1 | 0 | 0 | 1 | 1 |
| 1 | 0 | 0 | 0 | 1 | 1 | 1 | 0 |
| 1 | 0 | 0 | 1 | 1 | 1 | 0 | 1 |
| 1 | 0 | 1 | 0 | 1 | 1 | 1 | 0 |
| 1 | 0 | 1 | 1 | 1 | 1 | 0 | 1 |
| 1 | 1 | 0 | 0 | 1 | 1 | 1 | 0 |
| 1 | 1 | 0 | 1 | 1 | 1 | 0 | 1 |
| 1 | 1 | 1 | 0 | 0 | 0 | 1 | 1 |
| 1 | 1 | 1 | 1 | 0 | 0 | 0 | 1 |
(((A|B)∧D)|(A|C))∧((A∧(B|C))|(A|D)):
| A | B | D | C | A|B | (A|B)∧D | A|C | ((A|B)∧D)|(A|C) | B|C | A∧(B|C) | A|D | (A∧(B|C))|(A|D) | (((A|B)∧D)|(A|C))∧((A∧(B|C))|(A|D)) |
| 0 | 0 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 1 |
| 0 | 0 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 1 |
| 0 | 0 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 0 |
| 0 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 0 |
| 0 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 1 |
| 0 | 1 | 0 | 1 | 1 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 1 |
| 0 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 0 |
| 0 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 0 |
| 1 | 0 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 0 |
| 1 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 0 |
| 1 | 0 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 0 | 1 | 0 |
| 1 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 1 |
| 1 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 0 |
| 1 | 1 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 1 | 1 |
| 1 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 1 |
| 1 | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 1 |
((((A|B)∧D)|(A|C))∧((A∧(B|C))|(A|D)))∧((B|C)|D):
| A | B | D | C | A|B | (A|B)∧D | A|C | ((A|B)∧D)|(A|C) | B|C | A∧(B|C) | A|D | (A∧(B|C))|(A|D) | (((A|B)∧D)|(A|C))∧((A∧(B|C))|(A|D)) | B|C | (B|C)|D | ((((A|B)∧D)|(A|C))∧((A∧(B|C))|(A|D)))∧((B|C)|D) |
| 0 | 0 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 |
| 0 | 0 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 |
| 0 | 0 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 0 |
| 0 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 0 |
| 0 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 |
| 0 | 1 | 0 | 1 | 1 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 1 |
| 0 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 0 |
| 0 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 0 |
| 1 | 0 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 0 |
| 1 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 0 |
| 1 | 0 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | 0 | 0 |
| 1 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 0 |
| 1 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 0 |
| 1 | 1 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 1 |
| 1 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 0 |
| 1 | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 1 | 1 |
F≡(((((A|B)∧D)|(A|C))∧((A∧(B|C))|(A|D)))∧((B|C)|D)):
| F | A | B | D | C | A|B | (A|B)∧D | A|C | ((A|B)∧D)|(A|C) | B|C | A∧(B|C) | A|D | (A∧(B|C))|(A|D) | (((A|B)∧D)|(A|C))∧((A∧(B|C))|(A|D)) | B|C | (B|C)|D | ((((A|B)∧D)|(A|C))∧((A∧(B|C))|(A|D)))∧((B|C)|D) | F≡(((((A|B)∧D)|(A|C))∧((A∧(B|C))|(A|D)))∧((B|C)|D)) |
| 0 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 0 |
| 0 | 0 | 0 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 0 |
| 0 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 0 | 1 |
| 0 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 0 | 1 |
| 0 | 0 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 0 |
| 0 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 0 |
| 0 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 0 | 1 |
| 0 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | 1 |
| 0 | 1 | 0 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 1 |
| 0 | 1 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 1 |
| 0 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | 1 |
| 0 | 1 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 0 | 1 |
| 0 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 1 |
| 0 | 1 | 1 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 0 |
| 0 | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 0 | 1 |
| 0 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 1 | 1 | 0 |
| 1 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
| 1 | 0 | 0 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
| 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 0 | 0 |
| 1 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 0 | 0 |
| 1 | 0 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
| 1 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 1 |
| 1 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 0 | 0 |
| 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | 0 |
| 1 | 1 | 0 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 0 |
| 1 | 1 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 0 |
| 1 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | 0 |
| 1 | 1 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 0 | 0 |
| 1 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 0 |
| 1 | 1 | 1 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 1 |
| 1 | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 0 | 0 |
| 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 1 | 1 | 1 |
Общая таблица истинности:
| F | A | B | D | C | A|B | (A|B)∧D | A|C | B|C | A∧(B|C) | A|D | (B|C)|D | ((A|B)∧D)|(A|C) | (A∧(B|C))|(A|D) | (((A|B)∧D)|(A|C))∧((A∧(B|C))|(A|D)) | ((((A|B)∧D)|(A|C))∧((A∧(B|C))|(A|D)))∧((B|C)|D) | F≡(A|B∧D)|(A|C)∧(A∧B|C)|(A|D)∧(B|C|D) |
| 0 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 0 |
| 0 | 0 | 0 | 0 | 1 | 1 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 0 |
| 0 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 0 | 0 | 1 | 0 | 0 | 1 |
| 0 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 1 | 0 | 0 | 1 | 0 | 0 | 1 |
| 0 | 0 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 0 |
| 0 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 0 |
| 0 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 0 | 0 | 1 | 0 | 0 | 1 |
| 0 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 0 | 0 | 1 |
| 0 | 1 | 0 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 1 |
| 0 | 1 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 1 |
| 0 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 1 |
| 0 | 1 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 1 |
| 0 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 1 |
| 0 | 1 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 0 |
| 0 | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 1 |
| 0 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 0 |
| 1 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
| 1 | 0 | 0 | 0 | 1 | 1 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
| 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 0 | 0 | 1 | 0 | 0 | 0 |
| 1 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 1 | 0 | 0 | 1 | 0 | 0 | 0 |
| 1 | 0 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
| 1 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
| 1 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 0 | 0 | 1 | 0 | 0 | 0 |
| 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 0 | 0 | 0 |
| 1 | 1 | 0 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 |
| 1 | 1 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 |
| 1 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 |
| 1 | 1 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 0 |
| 1 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 |
| 1 | 1 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
| 1 | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 0 |
| 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 1 |
Совершенная дизъюнктивная нормальная форма (СДНФ):
По таблице истинности:
| F | A | B | D | C | F |
| 0 | 0 | 0 | 0 | 0 | 0 |
| 0 | 0 | 0 | 0 | 1 | 0 |
| 0 | 0 | 0 | 1 | 0 | 1 |
| 0 | 0 | 0 | 1 | 1 | 1 |
| 0 | 0 | 1 | 0 | 0 | 0 |
| 0 | 0 | 1 | 0 | 1 | 0 |
| 0 | 0 | 1 | 1 | 0 | 1 |
| 0 | 0 | 1 | 1 | 1 | 1 |
| 0 | 1 | 0 | 0 | 0 | 1 |
| 0 | 1 | 0 | 0 | 1 | 1 |
| 0 | 1 | 0 | 1 | 0 | 1 |
| 0 | 1 | 0 | 1 | 1 | 1 |
| 0 | 1 | 1 | 0 | 0 | 1 |
| 0 | 1 | 1 | 0 | 1 | 0 |
| 0 | 1 | 1 | 1 | 0 | 1 |
| 0 | 1 | 1 | 1 | 1 | 0 |
| 1 | 0 | 0 | 0 | 0 | 1 |
| 1 | 0 | 0 | 0 | 1 | 1 |
| 1 | 0 | 0 | 1 | 0 | 0 |
| 1 | 0 | 0 | 1 | 1 | 0 |
| 1 | 0 | 1 | 0 | 0 | 1 |
| 1 | 0 | 1 | 0 | 1 | 1 |
| 1 | 0 | 1 | 1 | 0 | 0 |
| 1 | 0 | 1 | 1 | 1 | 0 |
| 1 | 1 | 0 | 0 | 0 | 0 |
| 1 | 1 | 0 | 0 | 1 | 0 |
| 1 | 1 | 0 | 1 | 0 | 0 |
| 1 | 1 | 0 | 1 | 1 | 0 |
| 1 | 1 | 1 | 0 | 0 | 0 |
| 1 | 1 | 1 | 0 | 1 | 1 |
| 1 | 1 | 1 | 1 | 0 | 0 |
| 1 | 1 | 1 | 1 | 1 | 1 |
F
сднф = ¬F∧¬A∧¬B∧D∧¬C ∨ ¬F∧¬A∧¬B∧D∧C ∨ ¬F∧¬A∧B∧D∧¬C ∨ ¬F∧¬A∧B∧D∧C ∨ ¬F∧A∧¬B∧¬D∧¬C ∨ ¬F∧A∧¬B∧¬D∧C ∨ ¬F∧A∧¬B∧D∧¬C ∨ ¬F∧A∧¬B∧D∧C ∨ ¬F∧A∧B∧¬D∧¬C ∨ ¬F∧A∧B∧D∧¬C ∨ F∧¬A∧¬B∧¬D∧¬C ∨ F∧¬A∧¬B∧¬D∧C ∨ F∧¬A∧B∧¬D∧¬C ∨ F∧¬A∧B∧¬D∧C ∨ F∧A∧B∧¬D∧C ∨ F∧A∧B∧D∧C
Логическая cхема:
Совершенная конъюнктивная нормальная форма (СКНФ):
По таблице истинности:
| F | A | B | D | C | F |
| 0 | 0 | 0 | 0 | 0 | 0 |
| 0 | 0 | 0 | 0 | 1 | 0 |
| 0 | 0 | 0 | 1 | 0 | 1 |
| 0 | 0 | 0 | 1 | 1 | 1 |
| 0 | 0 | 1 | 0 | 0 | 0 |
| 0 | 0 | 1 | 0 | 1 | 0 |
| 0 | 0 | 1 | 1 | 0 | 1 |
| 0 | 0 | 1 | 1 | 1 | 1 |
| 0 | 1 | 0 | 0 | 0 | 1 |
| 0 | 1 | 0 | 0 | 1 | 1 |
| 0 | 1 | 0 | 1 | 0 | 1 |
| 0 | 1 | 0 | 1 | 1 | 1 |
| 0 | 1 | 1 | 0 | 0 | 1 |
| 0 | 1 | 1 | 0 | 1 | 0 |
| 0 | 1 | 1 | 1 | 0 | 1 |
| 0 | 1 | 1 | 1 | 1 | 0 |
| 1 | 0 | 0 | 0 | 0 | 1 |
| 1 | 0 | 0 | 0 | 1 | 1 |
| 1 | 0 | 0 | 1 | 0 | 0 |
| 1 | 0 | 0 | 1 | 1 | 0 |
| 1 | 0 | 1 | 0 | 0 | 1 |
| 1 | 0 | 1 | 0 | 1 | 1 |
| 1 | 0 | 1 | 1 | 0 | 0 |
| 1 | 0 | 1 | 1 | 1 | 0 |
| 1 | 1 | 0 | 0 | 0 | 0 |
| 1 | 1 | 0 | 0 | 1 | 0 |
| 1 | 1 | 0 | 1 | 0 | 0 |
| 1 | 1 | 0 | 1 | 1 | 0 |
| 1 | 1 | 1 | 0 | 0 | 0 |
| 1 | 1 | 1 | 0 | 1 | 1 |
| 1 | 1 | 1 | 1 | 0 | 0 |
| 1 | 1 | 1 | 1 | 1 | 1 |
F
скнф = (F∨A∨B∨D∨C) ∧ (F∨A∨B∨D∨¬C) ∧ (F∨A∨¬B∨D∨C) ∧ (F∨A∨¬B∨D∨¬C) ∧ (F∨¬A∨¬B∨D∨¬C) ∧ (F∨¬A∨¬B∨¬D∨¬C) ∧ (¬F∨A∨B∨¬D∨C) ∧ (¬F∨A∨B∨¬D∨¬C) ∧ (¬F∨A∨¬B∨¬D∨C) ∧ (¬F∨A∨¬B∨¬D∨¬C) ∧ (¬F∨¬A∨B∨D∨C) ∧ (¬F∨¬A∨B∨D∨¬C) ∧ (¬F∨¬A∨B∨¬D∨C) ∧ (¬F∨¬A∨B∨¬D∨¬C) ∧ (¬F∨¬A∨¬B∨D∨C) ∧ (¬F∨¬A∨¬B∨¬D∨C)
Логическая cхема:
Построение полинома Жегалкина:
По таблице истинности функции
| F | A | B | D | C | Fж |
| 0 | 0 | 0 | 0 | 0 | 0 |
| 0 | 0 | 0 | 0 | 1 | 0 |
| 0 | 0 | 0 | 1 | 0 | 1 |
| 0 | 0 | 0 | 1 | 1 | 1 |
| 0 | 0 | 1 | 0 | 0 | 0 |
| 0 | 0 | 1 | 0 | 1 | 0 |
| 0 | 0 | 1 | 1 | 0 | 1 |
| 0 | 0 | 1 | 1 | 1 | 1 |
| 0 | 1 | 0 | 0 | 0 | 1 |
| 0 | 1 | 0 | 0 | 1 | 1 |
| 0 | 1 | 0 | 1 | 0 | 1 |
| 0 | 1 | 0 | 1 | 1 | 1 |
| 0 | 1 | 1 | 0 | 0 | 1 |
| 0 | 1 | 1 | 0 | 1 | 0 |
| 0 | 1 | 1 | 1 | 0 | 1 |
| 0 | 1 | 1 | 1 | 1 | 0 |
| 1 | 0 | 0 | 0 | 0 | 1 |
| 1 | 0 | 0 | 0 | 1 | 1 |
| 1 | 0 | 0 | 1 | 0 | 0 |
| 1 | 0 | 0 | 1 | 1 | 0 |
| 1 | 0 | 1 | 0 | 0 | 1 |
| 1 | 0 | 1 | 0 | 1 | 1 |
| 1 | 0 | 1 | 1 | 0 | 0 |
| 1 | 0 | 1 | 1 | 1 | 0 |
| 1 | 1 | 0 | 0 | 0 | 0 |
| 1 | 1 | 0 | 0 | 1 | 0 |
| 1 | 1 | 0 | 1 | 0 | 0 |
| 1 | 1 | 0 | 1 | 1 | 0 |
| 1 | 1 | 1 | 0 | 0 | 0 |
| 1 | 1 | 1 | 0 | 1 | 1 |
| 1 | 1 | 1 | 1 | 0 | 0 |
| 1 | 1 | 1 | 1 | 1 | 1 |
Построим полином Жегалкина:
F
ж = C
00000 ⊕ C
10000∧F ⊕ C
01000∧A ⊕ C
00100∧B ⊕ C
00010∧D ⊕ C
00001∧C ⊕ C
11000∧F∧A ⊕ C
10100∧F∧B ⊕ C
10010∧F∧D ⊕ C
10001∧F∧C ⊕ C
01100∧A∧B ⊕ C
01010∧A∧D ⊕ C
01001∧A∧C ⊕ C
00110∧B∧D ⊕ C
00101∧B∧C ⊕ C
00011∧D∧C ⊕ C
11100∧F∧A∧B ⊕ C
11010∧F∧A∧D ⊕ C
11001∧F∧A∧C ⊕ C
10110∧F∧B∧D ⊕ C
10101∧F∧B∧C ⊕ C
10011∧F∧D∧C ⊕ C
01110∧A∧B∧D ⊕ C
01101∧A∧B∧C ⊕ C
01011∧A∧D∧C ⊕ C
00111∧B∧D∧C ⊕ C
11110∧F∧A∧B∧D ⊕ C
11101∧F∧A∧B∧C ⊕ C
11011∧F∧A∧D∧C ⊕ C
10111∧F∧B∧D∧C ⊕ C
01111∧A∧B∧D∧C ⊕ C
11111∧F∧A∧B∧D∧C
Так как F
ж(00000) = 0, то С
00000 = 0.
Далее подставляем все остальные наборы в порядке возрастания числа единиц, подставляя вновь полученные значения в следующие формулы:
F
ж(10000) = С
00000 ⊕ С
10000 = 1 => С
10000 = 0 ⊕ 1 = 1
F
ж(01000) = С
00000 ⊕ С
01000 = 1 => С
01000 = 0 ⊕ 1 = 1
F
ж(00100) = С
00000 ⊕ С
00100 = 0 => С
00100 = 0 ⊕ 0 = 0
F
ж(00010) = С
00000 ⊕ С
00010 = 1 => С
00010 = 0 ⊕ 1 = 1
F
ж(00001) = С
00000 ⊕ С
00001 = 0 => С
00001 = 0 ⊕ 0 = 0
F
ж(11000) = С
00000 ⊕ С
10000 ⊕ С
01000 ⊕ С
11000 = 0 => С
11000 = 0 ⊕ 1 ⊕ 1 ⊕ 0 = 0
F
ж(10100) = С
00000 ⊕ С
10000 ⊕ С
00100 ⊕ С
10100 = 1 => С
10100 = 0 ⊕ 1 ⊕ 0 ⊕ 1 = 0
F
ж(10010) = С
00000 ⊕ С
10000 ⊕ С
00010 ⊕ С
10010 = 0 => С
10010 = 0 ⊕ 1 ⊕ 1 ⊕ 0 = 0
F
ж(10001) = С
00000 ⊕ С
10000 ⊕ С
00001 ⊕ С
10001 = 1 => С
10001 = 0 ⊕ 1 ⊕ 0 ⊕ 1 = 0
F
ж(01100) = С
00000 ⊕ С
01000 ⊕ С
00100 ⊕ С
01100 = 1 => С
01100 = 0 ⊕ 1 ⊕ 0 ⊕ 1 = 0
F
ж(01010) = С
00000 ⊕ С
01000 ⊕ С
00010 ⊕ С
01010 = 1 => С
01010 = 0 ⊕ 1 ⊕ 1 ⊕ 1 = 1
F
ж(01001) = С
00000 ⊕ С
01000 ⊕ С
00001 ⊕ С
01001 = 1 => С
01001 = 0 ⊕ 1 ⊕ 0 ⊕ 1 = 0
F
ж(00110) = С
00000 ⊕ С
00100 ⊕ С
00010 ⊕ С
00110 = 1 => С
00110 = 0 ⊕ 0 ⊕ 1 ⊕ 1 = 0
F
ж(00101) = С
00000 ⊕ С
00100 ⊕ С
00001 ⊕ С
00101 = 0 => С
00101 = 0 ⊕ 0 ⊕ 0 ⊕ 0 = 0
F
ж(00011) = С
00000 ⊕ С
00010 ⊕ С
00001 ⊕ С
00011 = 1 => С
00011 = 0 ⊕ 1 ⊕ 0 ⊕ 1 = 0
F
ж(11100) = С
00000 ⊕ С
10000 ⊕ С
01000 ⊕ С
00100 ⊕ С
11000 ⊕ С
10100 ⊕ С
01100 ⊕ С
11100 = 0 => С
11100 = 0 ⊕ 1 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 = 0
F
ж(11010) = С
00000 ⊕ С
10000 ⊕ С
01000 ⊕ С
00010 ⊕ С
11000 ⊕ С
10010 ⊕ С
01010 ⊕ С
11010 = 0 => С
11010 = 0 ⊕ 1 ⊕ 1 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 1 ⊕ 0 = 0
F
ж(11001) = С
00000 ⊕ С
10000 ⊕ С
01000 ⊕ С
00001 ⊕ С
11000 ⊕ С
10001 ⊕ С
01001 ⊕ С
11001 = 0 => С
11001 = 0 ⊕ 1 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 = 0
F
ж(10110) = С
00000 ⊕ С
10000 ⊕ С
00100 ⊕ С
00010 ⊕ С
10100 ⊕ С
10010 ⊕ С
00110 ⊕ С
10110 = 0 => С
10110 = 0 ⊕ 1 ⊕ 0 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 = 0
F
ж(10101) = С
00000 ⊕ С
10000 ⊕ С
00100 ⊕ С
00001 ⊕ С
10100 ⊕ С
10001 ⊕ С
00101 ⊕ С
10101 = 1 => С
10101 = 0 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 1 = 0
F
ж(10011) = С
00000 ⊕ С
10000 ⊕ С
00010 ⊕ С
00001 ⊕ С
10010 ⊕ С
10001 ⊕ С
00011 ⊕ С
10011 = 0 => С
10011 = 0 ⊕ 1 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 = 0
F
ж(01110) = С
00000 ⊕ С
01000 ⊕ С
00100 ⊕ С
00010 ⊕ С
01100 ⊕ С
01010 ⊕ С
00110 ⊕ С
01110 = 1 => С
01110 = 0 ⊕ 1 ⊕ 0 ⊕ 1 ⊕ 0 ⊕ 1 ⊕ 0 ⊕ 1 = 0
F
ж(01101) = С
00000 ⊕ С
01000 ⊕ С
00100 ⊕ С
00001 ⊕ С
01100 ⊕ С
01001 ⊕ С
00101 ⊕ С
01101 = 0 => С
01101 = 0 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 = 1
F
ж(01011) = С
00000 ⊕ С
01000 ⊕ С
00010 ⊕ С
00001 ⊕ С
01010 ⊕ С
01001 ⊕ С
00011 ⊕ С
01011 = 1 => С
01011 = 0 ⊕ 1 ⊕ 1 ⊕ 0 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 1 = 0
F
ж(00111) = С
00000 ⊕ С
00100 ⊕ С
00010 ⊕ С
00001 ⊕ С
00110 ⊕ С
00101 ⊕ С
00011 ⊕ С
00111 = 1 => С
00111 = 0 ⊕ 0 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 1 = 0
F
ж(11110) = С
00000 ⊕ С
10000 ⊕ С
01000 ⊕ С
00100 ⊕ С
00010 ⊕ С
11000 ⊕ С
10100 ⊕ С
10010 ⊕ С
01100 ⊕ С
01010 ⊕ С
00110 ⊕ С
11100 ⊕ С
11010 ⊕ С
10110 ⊕ С
01110 ⊕ С
11110 = 0 => С
11110 = 0 ⊕ 1 ⊕ 1 ⊕ 0 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 = 0
F
ж(11101) = С
00000 ⊕ С
10000 ⊕ С
01000 ⊕ С
00100 ⊕ С
00001 ⊕ С
11000 ⊕ С
10100 ⊕ С
10001 ⊕ С
01100 ⊕ С
01001 ⊕ С
00101 ⊕ С
11100 ⊕ С
11001 ⊕ С
10101 ⊕ С
01101 ⊕ С
11101 = 1 => С
11101 = 0 ⊕ 1 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 1 ⊕ 1 = 0
F
ж(11011) = С
00000 ⊕ С
10000 ⊕ С
01000 ⊕ С
00010 ⊕ С
00001 ⊕ С
11000 ⊕ С
10010 ⊕ С
10001 ⊕ С
01010 ⊕ С
01001 ⊕ С
00011 ⊕ С
11010 ⊕ С
11001 ⊕ С
10011 ⊕ С
01011 ⊕ С
11011 = 0 => С
11011 = 0 ⊕ 1 ⊕ 1 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 = 0
F
ж(10111) = С
00000 ⊕ С
10000 ⊕ С
00100 ⊕ С
00010 ⊕ С
00001 ⊕ С
10100 ⊕ С
10010 ⊕ С
10001 ⊕ С
00110 ⊕ С
00101 ⊕ С
00011 ⊕ С
10110 ⊕ С
10101 ⊕ С
10011 ⊕ С
00111 ⊕ С
10111 = 0 => С
10111 = 0 ⊕ 1 ⊕ 0 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 = 0
F
ж(01111) = С
00000 ⊕ С
01000 ⊕ С
00100 ⊕ С
00010 ⊕ С
00001 ⊕ С
01100 ⊕ С
01010 ⊕ С
01001 ⊕ С
00110 ⊕ С
00101 ⊕ С
00011 ⊕ С
01110 ⊕ С
01101 ⊕ С
01011 ⊕ С
00111 ⊕ С
01111 = 0 => С
01111 = 0 ⊕ 1 ⊕ 0 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 0 = 0
F
ж(11111) = С
00000 ⊕ С
10000 ⊕ С
01000 ⊕ С
00100 ⊕ С
00010 ⊕ С
00001 ⊕ С
11000 ⊕ С
10100 ⊕ С
10010 ⊕ С
10001 ⊕ С
01100 ⊕ С
01010 ⊕ С
01001 ⊕ С
00110 ⊕ С
00101 ⊕ С
00011 ⊕ С
11100 ⊕ С
11010 ⊕ С
11001 ⊕ С
10110 ⊕ С
10101 ⊕ С
10011 ⊕ С
01110 ⊕ С
01101 ⊕ С
01011 ⊕ С
00111 ⊕ С
11110 ⊕ С
11101 ⊕ С
11011 ⊕ С
10111 ⊕ С
01111 ⊕ С
11111 = 1 => С
11111 = 0 ⊕ 1 ⊕ 1 ⊕ 0 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 1 = 0
Таким образом, полином Жегалкина будет равен:
F
ж = F ⊕ A ⊕ D ⊕ A∧D ⊕ A∧B∧C
Логическая схема, соответствующая полиному Жегалкина:
