Maieli, Roberto A proof of the focusing theorem via MALL proof nets. (English) Zbl 07691312 Ciabattoni, Agata (ed.) et al., Logic, language, information, and computation. 28th international workshop, WoLLIC 2022, Iași, Romania, September 20–23, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13468, 1-17 (2022). MSC: 03B70 PDFBibTeX XMLCite \textit{R. Maieli}, Lect. Notes Comput. Sci. 13468, 1--17 (2022; Zbl 07691312) Full Text: DOI
Maieli, Roberto Non decomposable connectives of linear logic. (English) Zbl 07114342 Ann. Pure Appl. Logic 170, No. 11, Article ID 102709, 27 p. (2019). MSC: 03F52 03F05 03F07 PDFBibTeX XMLCite \textit{R. Maieli}, Ann. Pure Appl. Logic 170, No. 11, Article ID 102709, 27 p. (2019; Zbl 07114342) Full Text: DOI HAL
Abrusci, V. Michele; Maieli, Roberto Proof nets for multiplicative cyclic linear logic and Lambek calculus. (English) Zbl 1456.03092 Math. Struct. Comput. Sci. 29, No. 6, 733-762 (2019). MSC: 03F52 03B47 03F07 PDFBibTeX XMLCite \textit{V. M. Abrusci} and \textit{R. Maieli}, Math. Struct. Comput. Sci. 29, No. 6, 733--762 (2019; Zbl 1456.03092) Full Text: DOI
Abrusci, Vito Michele; Maieli, Roberto Cyclic multiplicative-additive proof nets of linear logic with an application to language parsing. (English) Zbl 1478.03081 Foret, Annie (ed.) et al., Formal grammar. 20th and 21st international conferences, FG 2015, Barcelona, Spain, August 2015. Revised selected papers. FG 2016, Bozen, Italy, August 2016. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 9804, 43-59 (2016). MSC: 03F52 03B65 PDFBibTeX XMLCite \textit{V. M. Abrusci} and \textit{R. Maieli}, Lect. Notes Comput. Sci. 9804, 43--59 (2016; Zbl 1478.03081) Full Text: DOI HAL
Abrusci, Vito Michele; Maieli, Roberto Cyclic multiplicative proof nets of linear logic with an application to language parsing. (English) Zbl 1365.03039 Paiva, Valeria (ed.) et al., Logic, language, information, and computation. 22nd international workshop, WoLLIC 2015, Bloomington, IN, USA, July 20–23, 2015. Proceedings. Berlin: Springer (ISBN 978-3-662-47708-3/pbk; 978-3-662-47709-0/ebook). Lecture Notes in Computer Science 9160, 53-68 (2015). MSC: 03F52 03B47 03B65 03B70 68T50 PDFBibTeX XMLCite \textit{V. M. Abrusci} and \textit{R. Maieli}, Lect. Notes Comput. Sci. 9160, 53--68 (2015; Zbl 1365.03039) Full Text: DOI
Andreoli, Jean-Marc; Maieli, Roberto; Ruet, Paul Non-commutative proof construction: a constraint-based approach. (English) Zbl 1175.03038 Ann. Pure Appl. Logic 142, No. 1-3, 212-244 (2006). MSC: 03F52 PDFBibTeX XMLCite \textit{J.-M. Andreoli} et al., Ann. Pure Appl. Logic 142, No. 1--3, 212--244 (2006; Zbl 1175.03038) Full Text: DOI
Maieli, Roberto; Puite, Quintijn Modularity of proof-nets. Generating the type of a module. (English) Zbl 1061.03071 Arch. Math. Logic 44, No. 2, 167-193 (2005). MSC: 03F52 PDFBibTeX XMLCite \textit{R. Maieli} and \textit{Q. Puite}, Arch. Math. Logic 44, No. 2, 167--193 (2005; Zbl 1061.03071) Full Text: DOI
Maieli, Roberto; Ruet, Paul Non-commutative logic. III: Focusing proofs. (English) Zbl 1072.03035 Inf. Comput. 185, No. 2, 233-262 (2003). Reviewer: Lorenzo Tortora de Falco (Roma) MSC: 03F52 03F03 03F07 PDFBibTeX XMLCite \textit{R. Maieli} and \textit{P. Ruet}, Inf. Comput. 185, No. 2, 233--262 (2003; Zbl 1072.03035) Full Text: DOI