Homological Perturbation Theory [11, 13] is a well-known general method for computing homology, but its main algorithm, the Basic Perturbation Lemma, presents, in general, high com...
Our research seeks to understand how to extend established organization theory and emerging knowledgeflow theory to inform the design of organizations with discontinuous participa...
We define a generic notion of cut that applies to many first-order theories. We prove a generic cut elimination theorem showing that the cut elimination property holds for all theo...
We present various results of the last twenty years converging towards a homotopical theory of computation. This new theory is based on two crucial notions : polygraphs (introduce...
In this paper a theory for the synthesis of geometric concepts is presented. The theory is focused on a constructive process that synthesizes a function in the geometric domain re...