Algebras and logics of partial quasiary predicates
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 quasiar...
Saved in:
| Published in: | Algebra and Discrete Mathematics |
|---|---|
| Date: | 2017 |
| Main Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Інститут прикладної математики і механіки НАН України
2017
|
| Online Access: | https://nasplib.isofts.kiev.ua/handle/123456789/156020 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| Cite this: | Algebras and logics of partial quasiary predicates / M. Nikitchenko, S. Shkilniak // Algebra and Discrete Mathematics. — 2017. — Vol. 23, № 2. — С. 263–278. — Бібліогр.: 7 назв. — англ. |
Institution
Digital Library of Periodicals of National Academy of Sciences of Ukraine| Summary: | 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.
|
|---|---|
| ISSN: | 1726-3255 |