Автоматизация технологических и бизнес-процессов

Revista Română de Informatică și Automatică
Published: (2017)

Vestnik KRAUNC: Fiziko-Matematičeskie Nauki
Published: (2016)

Advanced Manufacturing: Polymer & Composites Science
Published: (2017)

Automatika
Published: (2018)

Кібернетика та комп'ютерні технології
Published: (2021)

ITM Web of Conferences
Published: (2014)

International Journal of Science, Technology, Engineering and Mathematics
Published: (2023)

Ìнформаційні технології та компʼютерна інженерія
Published: (2025)

Herald of Advanced Information Technology
Published: (2026)

Transportation and Information Technologies in Russia
Published: (2026)

Teaching Mathematics and Computer Science
Published: (2024)

Malaysian Journal of Computing
Published: (2023)

International Journal of Advanced Studies
Published: (2018)

Информатика и автоматизация
Published: (2021)

Towards a mathematical system for extension education
by: Kaul, P.N.
Published: (1984)

Сучасний стан наукових досліджень та технологій в промисловості
Published: (2018)

Information Technology and Libraries
Published: (2012)

Wasit Journal of Computer and Mathematics Science
Published: (2024)

Organizacija Znanja
Published: (2023)

Towards a mathematical system for extension education - II
by: Kaul, P.N., et al.
Published: (1987)

PUP Journal of Science and Technology
Published: (2025)

Наукові вісті Національного технічного університету України "Київський політехнічний інститут"
Published: (2017)

Современные информационные технологии и IT-образование
Published: (2018)

Вестник Донского государственного технического университета
Published: (2018)

Claim Verification: "The binary operator eml is defined by the expression \(\text{eml}(a, b) = \exp(a) - \ln(b)\) (where exp is the exponential function and ln is the principal branch of the natural logarithm). For every real \(x > 0\), the nested expression \(\text{eml}(1, \text{eml}(\text{eml}(1, x), 1))\) equals the natural logarithm \(\ln(x)\)." — Proved
by: Proof Engine
Published: (2026)

Claim Verification: "The binary operator eml is defined by the expression \(\text{eml}(a, b) = \exp(a) - \ln(b)\). There exists a finite binary tree consisting solely of eml operations, whose 9 leaves are drawn from \(\{1, x, y\}\), such that the tree evaluates exactly to \(x \times y\). The tree has K = 17 tokens (8 eml operations and 9 leaves), and the identity holds for all complex \(x\) and \(y\) (in the algebraic setting where \(\ln \circ \exp\) is the identity)." — Proved
by: Proof Engine
Published: (2026)

Ķazaķstan-britan tehnikalyķ universitetìnìņ habaršysy
Published: (2023)

International Journal of Computers Communications & Control
Published: (2017)

Advanced Engineering Research
Published: (2021)

Hexagon
Published: (2024)

Informatika
Published: (2017)

المجلة العربية الدولية لتكنولوجيا المعلومات والبيانات
Published: (2026)

ROBOMECH Journal
Published: (2015)

Физика волновых процессов и радиотехнические системы
Published: (2023)

Revista Minerva
Published: (2024)

Enterprise Modelling and Information Systems Architectures
Published: (2021)