of this paper is to prevent the abstract data type researcher from an improper, naive use of category theory. We mainly emphasize some unpleasant properties of the synthesis funct...
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...
Abstract. This paper explores theories that help in (i) proving that a system composed from components satisfies a system specification given only specifications of components and ...
Using a slight generalization, due to Palmgren, of sheaf semantics, we present a term-model construction that assigns a model to any first-order intuitionistic theory. A modificat...
The chi calculus is studied in the framework incorporating two constructions widely useful in applications: asymmetric communication and mismatch condition. The barbed bisimilarity...