Structuring theories on consequence
Lecture notes in Computer Science on Recent trends in data type specification
Equality-test and if-then-else algebras: axiomatization and specification
SIAM Journal on Computing
Topology and category theory in computer science
Behavioural and abstractor specifications
ESOP '94 Selected papers of ESOP '94, the 5th European symposium on Programming
Behavioural theories and the proof of behavioural properties
ALP Proceedings of the fourth international conference on Algebraic and logic programming
On behavioural abstraction and behavioural satisfaction in higher-order logic
TAPSOFT '95 Selected papers from the 6th international joint conference on Theory and practice of software development
Theoretical Computer Science
Swinging types = functions + relations + transition systems
Theoretical Computer Science
Observational proofs by rewriting
Theoretical Computer Science
Behavioural Equivalence, Bisimulation, and Minimal Realisation
Selected papers from the 11th Workshop on Specification of Abstract Data Types Joint with the 8th COMPASS Workshop on Recent Trends in Data Type Specification
Proving Behavioural Theorems with Standard First-Order Logic
ALP '94 Proceedings of the 4th International Conference on Algebraic and Logic Programming
Behavioural reasoning for conditional equations
Mathematical Structures in Computer Science
Observational Refinement Process
Electronic Notes in Theoretical Computer Science (ENTCS)
Studia Logica
A Coalgebraic Perspective on Logical Interpretations
Studia Logica
| Hi-index | 5.23 |
Hidden k-logics can be considered as the underlying logics of program specification. They constitute natural generalizations of k-deductive systems and encompass deductive systems as well as hidden equational logics and inequational logics. In our abstract algebraic approach, the data structures are sorted algebras endowed with a designated subset of their visible parts, called filter, which represents a set of truth values. We present a hierarchy of classes of hidden k-logics. The hidden k-logics in each class are characterized by three different kinds of conditions, namely, properties of their Leibniz operators, closure properties of the class of their behavioral models, and properties of their equivalence systems. Using equivalence systems, we obtain a new and more complete analysis of the axiomatization of the behavioral models. This is achieved by means of the Leibniz operator and its combinatorial properties.