Author: Editorial team

Raul Fervari joined LMF, U. Paris-Saclay, from September to December 2025, funded by the Jean D’Alembert Program.

Verónica Becher participated in the International Conference on “Prime numbers and arithmetic randomness”, Centre International de Rencontres Mathématiques (CIRM) , Marseille, Junio 23-25, 2025.
She talked about “A simply nomal number with digit dependencies”, joint work between Verónica Becher (UBA), Gérald Tenenbaum (CNRS Institut Élie Cartan de Lorraine, France), Agustín Marchionna (UBA).

Mélodie Andrieu, CNRS and University of the Littoral Opal Coast, France, in delegation in Center for Mathematical Modeling (CMM), at Universidad de Chile, visits Buenos Aires 26 to 29 July 2025 to work with Verónica Becher and the group KAPOW.

Alejandro Díaz-Caro visits Buenos Aires from July 21 to August 15 to work with his PhD students Malena Ivnisky, Nicolás Monzón, Rafael Romero, and Cristian Sottile, founded by the MSCA-SE QCOMICAL project.

Santiago Figueira visited LaBRI, Bordeaux from 2 to 13 July, to work with Diego Figueira.

Malena Ivnisky (PhD student at Universidad de Buenos Aires) is visiting the Centre Inria de l’Université de Lorraine in Nancy to collaborate with Alejandro Díaz-Caro, funded by an Uruguayan CSIC project and the MSCA-SE QCOMICAL project, from June 30 to July 11 2025.

Cristian Sottile (PhD candidate at Universidad de Buenos Aires) visited the Laboratoire d’informatique de l’École polytechnique invited by Noam Zeilberger, and gave a talk at the Proofs and Algorithms Seminar, funded by MSCA-SE QCOMICAL project, on June 30.

Cristian Sottile (PhD candidate at Universidad de Buenos Aires) visited the Centre Inria de l’Université de Lorraine in Nancy to collaborate with Alejandro Díaz-Caro, funded by MSCA-SE QCOMICAL project, from June 23 to June 27.

Cristian Sottile (PhD candidate at Universidad de Buenos Aires) visited the Institut de Recherche en Informatique Fondamentale in Université Paris–Cité to collaborate with Giulio Manzonetto, funded by MSCA-SE QCOMICAL project, from June 2 to June 16

Title: On the Completeness of a Syntactically Linear Logic

Abstract: The L^S calculus, an extension of the proof language of linear logic related to quantum computing, was given a concrete semantics in [DCM23]. In this thesis, we prove completeness results for this semantics with respect to computational equivalence. We introduce an operational semantics for L^S and show its isomorphism with the categorical semantics under certain conditions. Moreover, we show that the category can be restricted to finitely generated semimodules, which possess better properties.