|
Список литературы
Генератор кроссвордов
Генератор титульных листов
Таблица истинности ONLINE
Прочие ONLINE сервисы
|
|
Таблица истинности для функции ¬(A∧(¬B))∧¬(C∧D):
Промежуточные таблицы истинности:¬B: A∧(¬B): | A | B | ¬B | A∧(¬B) | | 0 | 0 | 1 | 0 | | 0 | 1 | 0 | 0 | | 1 | 0 | 1 | 1 | | 1 | 1 | 0 | 0 |
C∧D: ¬(A∧(¬B)): | A | B | ¬B | A∧(¬B) | ¬(A∧(¬B)) | | 0 | 0 | 1 | 0 | 1 | | 0 | 1 | 0 | 0 | 1 | | 1 | 0 | 1 | 1 | 0 | | 1 | 1 | 0 | 0 | 1 |
¬(C∧D): | C | D | C∧D | ¬(C∧D) | | 0 | 0 | 0 | 1 | | 0 | 1 | 0 | 1 | | 1 | 0 | 0 | 1 | | 1 | 1 | 1 | 0 |
(¬(A∧(¬B)))∧(¬(C∧D)): | A | B | C | D | ¬B | A∧(¬B) | ¬(A∧(¬B)) | C∧D | ¬(C∧D) | (¬(A∧(¬B)))∧(¬(C∧D)) | | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | | 0 | 0 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | | 0 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 0 | 0 | | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 1 | | 0 | 1 | 0 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | | 0 | 1 | 1 | 0 | 0 | 0 | 1 | 0 | 1 | 1 | | 0 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 0 | | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 1 | 0 | | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | | 1 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 0 | 0 | | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 1 | | 1 | 1 | 0 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 0 | 1 | 1 | | 1 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 0 |
Общая таблица истинности:| A | B | C | D | ¬B | A∧(¬B) | C∧D | ¬(A∧(¬B)) | ¬(C∧D) | ¬(A∧(¬B))∧¬(C∧D) | | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 0 | 0 | | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | | 0 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 0 | | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 1 | 0 | | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | | 1 | 1 | 0 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | | 1 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 0 |
Совершенная конъюнктивная нормальная форма (СКНФ):
По таблице истинности: | A | B | C | D | F | | 0 | 0 | 0 | 0 | 1 | | 0 | 0 | 0 | 1 | 1 | | 0 | 0 | 1 | 0 | 1 | | 0 | 0 | 1 | 1 | 0 | | 0 | 1 | 0 | 0 | 1 | | 0 | 1 | 0 | 1 | 1 | | 0 | 1 | 1 | 0 | 1 | | 0 | 1 | 1 | 1 | 0 | | 1 | 0 | 0 | 0 | 0 | | 1 | 0 | 0 | 1 | 0 | | 1 | 0 | 1 | 0 | 0 | | 1 | 0 | 1 | 1 | 0 | | 1 | 1 | 0 | 0 | 1 | | 1 | 1 | 0 | 1 | 1 | | 1 | 1 | 1 | 0 | 1 | | 1 | 1 | 1 | 1 | 0 |
F скнф = (A∨B∨¬C∨¬D) ∧ (A∨¬B∨¬C∨¬D) ∧ (¬A∨B∨C∨D) ∧ (¬A∨B∨C∨¬D) ∧ (¬A∨B∨¬C∨D) ∧ (¬A∨B∨¬C∨¬D) ∧ (¬A∨¬B∨¬C∨¬D) Логическая cхема:
|
 |
|
 |
|
Вход на сайт
Информация
В нашем каталоге
Околостуденческое
|