Logical consequence relations in logics of monotone predicates and logics of antitone predicates

• Дата: 2018
• Автор: Shkilniak, O.S.
• Формат: Стаття
• Мова: Ukrainian
• Опубліковано: Інститут програмних систем НАН України 2018
• Теми: logic; predicate; semantics; logical consequence; UDC 004.42:510.69
• Онлайн доступ: https://pp.isofts.kiev.ua/index.php/ojs1/article/view/219
• Назва журналу: Problems in programming

Logical consequence is one of the fundamental concepts in logic. In this paper we study logical consequence relations for program-oriented logical formalisms: pure first-order composition nominative logics of quasiary predicates. In our research we are giving special attention to different types of logical consequence relations in various semantics of logics of monotone predicates and logics of antitone predicates. For pure first-order logics of quasiary predicates we specify composition algebras of predicates, languages, interpretation classes (sematics) and logical consequence relations. We obtain the pairwise distinct relations: irrefutability consequence P |= IR , consequence on truth P |= T , consequence on falsity P |= F, strong consequence P |= TF in P-sеmantics of partial singlevalued predicates and strong consequence R |= TF in R-sеmantics of partial multi-valued predicates. Of the total of 20 of defined logical consequence relations in logics of monotone predicates and of antitone predicates, the following ones are pairwise distinct: PE |= IR, PE |= T, PE |= F, PE |= TF, RM |= T, RM |= F, RM |= TF. A number of examples showing the differences between various types of logical consequence relations is given. We summarize the results concerning the existence of a particular logical consequence relation for certain sets of formulas in a table and determine interrelations between different types of logical consequence relations.Problems in programming 2017; 1: 21-29