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