A sentence preservation theorem for Boolean algebras Научная публикация
| Журнал |
Journal of Mathematical Sciences (United States)
ISSN: 1072-3374 , E-ISSN: 1573-8795 |
||||
|---|---|---|---|---|---|
| Вых. Данные | Год: 2023, Том: 271, Номер: 6, Страницы: 700-707 Страниц : 8 DOI: 10.1007/s10958-023-06599-4 | ||||
| Ключевые слова | Boolean algebra, Venn diagram, truth table, Horn formula | ||||
| Авторы |
|
||||
| Организации |
|
Информация о финансировании (1)
| 1 | Институт математики им. С.Л. Соболева СО РАН | FWNF-2022-0004 |
Реферат:
At the initial stages of studying the theory of Boolean algebras, before trying to prove or disprove any simple sentence, students are usually asked to test their intuition using Venn diagrams or truth tables. A natural question arises: is it necessary to invent a proof after a positive check of this kind? Isn't such a check itself a rigorous proof of the verified sentence? And if this is not true in the general case, for which sentences is this true? We answer the question and prove an analog of the Jech Theorem for arbitrary (not necessarily complete) Boolean algebras.
Библиографическая ссылка:
Gutman A.E.
A sentence preservation theorem for Boolean algebras
Journal of Mathematical Sciences (United States). 2023. V.271. N6. P.700-707. DOI: 10.1007/s10958-023-06599-4 Scopus РИНЦ OpenAlex
A sentence preservation theorem for Boolean algebras
Journal of Mathematical Sciences (United States). 2023. V.271. N6. P.700-707. DOI: 10.1007/s10958-023-06599-4 Scopus РИНЦ OpenAlex
Даты:
| Принята к публикации: | 31 июл. 2023 г. |
| Опубликована в печати: | 27 окт. 2023 г. |
| Опубликована online: | 27 окт. 2023 г. |
Идентификаторы БД:
| Scopus: | 2-s2.0-85174826319 |
| РИНЦ: | 63486767 |
| OpenAlex: | W4388194954 |
Цитирование в БД:
Пока нет цитирований