Аннотация:ABSTRACT. This paper is devoted to the study of “connegation,” a variant of unarytruth-functional logical operation, combining the properties of conflation and negation,operations known in bilattice theory. Semantically, connegation is specifiedwithin a four-valued semantic framework, employing a particular structure of generalizedtruth values introduced therein. We present a logical system, dCP, determinedby our four-valued structure, whose language is equipped with a unary propositionalconnective corresponding to the semantically defined connegation operation.We present axiomatizations of dCP in the form of Hilbert-style and Gentzen-styleproof-systems and provide corresponding soundness and completeness theorems. Acut-elimination argument for the Gentzen-style calculus is presented as well.Keywords. Conflation, Connegation, Embedding results, Generalized truth values,Gentzen-style calculi, Hilbert-style calculi, Negation
