Наукова електронна бібліотека
періодичних видань НАН України
періодичних видань НАН України
Algebras and logics of partial quasiary predicates
Репозиторій DSpace/Manakin
JavaScript is disabled for your browser. Some features of this site may not work without it.
Algebras and logics of partial quasiary predicates
Інший ID:
2010 MSC:03G25, 08A70, 03B70.
Посилання:
Algebras and logics of partial quasiary predicates / M. Nikitchenko, S. Shkilniak // Algebra and Discrete Mathematics. — 2017. — Vol. 23, № 2. — С. 263–278. — Бібліогр.: 7 назв. — англ.
Підтримка:
This work was supported in part by the project “Development of logic-algorithmic methods for investigation of formal models of natural languages” of Taras Shevchenko National University of Kyiv, Ukraine, Ref. Nr. 0116U004780.
Дата:
2017
Переглядів:
583
Завантажень:
170
Анотація:
In the paper we investigate algebras and logics defined for classes of partial quasiary predicates. Informally speaking, such predicates are partial predicates defined over partial states (partial assignments) of variables. Conventional n-ary predicates can be considered as a special case of quasiary predicates. The notion of quasiary predicate, as well as the notion of quasiary function, is used in computer science to represent semantics of computer programs and their components. We define extended first-order algebras of partial quasiary predicates and investigate their properties. Based on such algebras we define a logic with irrefutability consequence relation. A sequent calculus is constructed for this logic, its soundness and completeness are proved.
