Першопорядковi композиційно-номінативні логіки з предикатами слабкої та строгої рівності

Abstract

Development of the new software-oriented logical formalisms is a topical problem. The paper introduces lo­gics of partial predicates with predicate complement and equality predicates, we denote them LCE. They ex­tend logics of quasiary predicates with equality and logics with predicate complement. The composition of the predicate complement is used in Floyd-Hoare pro­­gram logics’ extensions on the class of partial predi­cates. We define predicates of weak equality and of strong equality. Thus, LCE with predicates of weak equality (denoted by LCEw) and LCE with predicates of strong equality (denoted by LCEs) can be specified. LCE can be studied on the first order and renominative levels. We consider composition algebras of LCE, investigate properties of their compositions and describe first order languages of such logics. We concentrate on the properties related to the equality predicates and the composition of the predicate complement. Various variants of logical consequence relations for the first order LCE are introduced and studied: P |= T , P |= F , R |= T , R |= F , P |= TF , R |= TF , P |= IR . In particular, we obtained that LCEw are somewhat degenerate, as for them all the relations are incorrect except for the irrefutability logical consequence relation under the conditions of undefinedness |= IR ^ . At the same time, all of the listed relations are correct for LCEs. Properties of the logical consequence relations are the semantic basis for con­struction of the respective calculi of sequential type. Further investigation of logical consequence relations for LCE includes adding the conditions of undefined­ness and constructing the corresponding sequent calcu­li; it is planned to be displayed in the forthcoming ar­ticles. Problems in programming 2019; 3: 28-44