Abstract We used agent-based modelling to highlight the advantages and disadvantages of several management styles in biology, ranging from centralized to egalitarian ones. In egalitarian groups, all team members are connected with each other, while in centralized ones, they are only connected with the principal investigator. Our model incorporated time constraints, which negatively influenced weakly connected groups such as centralized ones. Moreover, our results show that egalitarian groups outperform others if the questions addressed are relatively simple or when the communication among agents is limited. Complex epistemic spaces are explored best by centralized groups. They outperform other team structures because the individual members can develop their own ideas with less interference of the opinions of others. The optimal ratio between time spent on experimentation and dissemination varies between different organizational structures. Furthermore, if the evidence is shared only after a relevant degree of certainty is reached, all investigated groups epistemically profit. We discovered that the introduction of seminars to the model changes the epistemic performance in favour of weakly connected teams. Finally, the abilities of the principal investigator do not seem to outperform cognitive diversity, as group performances were not strongly influenced by the increase of her abilities.

The present article provides an analysis of the existing proof systems for dynamic epistemic logic from the viewpoint of proof-theoretic semantics. Dynamic epistemic logic is one of the best known members of a family of logical systems that have been successfully applied to diverse scientific disciplines, but the proof-theoretic treatment of which presents many difficulties. After an illustration of the proof-theoretic semantic principles most relevant to the treatment of logical connectives, we turn to illustrating the main features of display calculi, a proof-theoretic paradigm that has been successfully employed to give a proof-theoretic semantic account of modal and substructural logics. Then, we review some of the most significant proposals of proof systems for dynamic epistemic logics, and we critically reflect on them in the light of the previously introduced proof-theoretic semantic principles. The contributions of the present article include a generalization of Belnap's cut-elimination metatheorem for display calculi, and a revised version of the display-style calculus D.EAK [30]. We verify that the revised version satisfies the previously mentioned proof-theoretic semantic principles, and show that it enjoys cut-elimination as a consequence of the generalized metatheorem.

In the present article, we introduce a multi-type display calculus for dynamic epistemic logic, which we refer to as Dynamic Calculus. The display approach is suitable to modularly chart the space of dynamic epistemic logics on weaker-than-classical propositional base. The presence of types endows the language of the Dynamic Calculus with additional expressivity, allows for a smooth proof-theoretic treatment, and paves the way towards a general methodology for the design of proof systems for the generality of dynamic logics, and certainly beyond dynamic epistemic logic. We prove that the Dynamic Calculus adequately captures Baltag–Moss–Solecki's dynamic epistemic logic, and enjoys Belnap-style cut elimination.