ABSTRACT
The inspiration for relational formalization of logical systems comes from the need for the development of proof theory for information logics and from the successful relational modelling of programming constructs and phenomena. One of the main advantages of relational formalization is that the classical opposition between extensional and intensional or between compositional and noncompositional is eliminated. Similarly, the opposition between static and dynamic or between declarative and procedural is transformed into a coexistence in a uniform framework.
In this chapter we illustrate the methodology of relational formalization with examples taken from the areas of applied temporal logics, information logics and temporal information logics.
