A short overview of Hidden Logic

Abstract

In this paper we review a hidden (sorted) generalization of kdeductive systems -hidden k-logics. They encompass deductive systems as well as hidden equational logics and inequational logics. The special case of hidden equational logics has been used to specify and to verify properties in program development of behavioral systems within the dichotomy visible vs. hidden data. We recall one of the main applications of this work -the study of behavioral equivalence. Related results are obtained through combinatorial properties of the Leibniz congruence relation.In addition we obtain a few new developments concerning hidden equational logic, namely we present a new characterization of the behavioral consequences of a theory.