V. Michele Abrusci

According to our database, V. Michele Abrusci authored at least 26 papers between 1989 and 2019.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2019

Proof nets for multiplicative cyclic linear logic and Lambek calculus.

V. Michele Abrusci, Roberto Maieli

Math. Struct. Comput. Sci., 2019

2017

A Geometrical Representation of the Basic Laws of Categorial Grammar.

V. Michele Abrusci, Claudia Casadio

Stud Logica, 2017

Hilbert's tau and epsilon in Proof Theoretical Foundations of Mathematics: An Introduction.

V. Michele Abrusci

FLAP, 2017

2016

Analytic and synthetic in logic.

V. Michele Abrusci

Log. J. IGPL, 2016

2015

Cyclic Multiplicative Proof Nets of Linear Logic with an Application to Language Parsing.

Vito Michele Abrusci, Roberto Maieli

Proceedings of the Logic, Language, Information, and Computation, 2015

Cyclic Multiplicative-Additive Proof Nets of Linear Logic with an Application to Language Parsing.

Vito Michele Abrusci, Roberto Maieli

Proceedings of the Formal Grammar - 20th and 21st International Conferences, 2015

2014

Formal Ontologies and Coherent Spaces.

V. Michele Abrusci, Christophe Fouqueré, Marco Romano

J. Appl. Log., 2014

On Residuation.

V. Michele Abrusci

Proceedings of the Categories and Types in Logic, Language, and Physics, 2014

2013

Universal vs. particular reasoning: a study with neuroimaging techniques.

V. Michele Abrusci, Claudia Casadio, M. Teresa Medaglia, Camillo Porcaro

Log. J. IGPL, 2013

Some proof theoretical remarks on quantification in ordinary language

V. Michele Abrusci, Christian Retoré

CoRR, 2013

2011

Ontologies and Coherence Spaces.

V. Michele Abrusci, Marco Romano, Christophe Fouqueré

Proceedings of the Ludics, Dialogue and Interaction - PRELUDE Project, 2011

2009

Knowledge Representation through Coherence Spaces - A Theoretical Framework for the Integration of Knowledge Representations.

V. Michele Abrusci, Marco Romano, Christophe Fouqueré

Proceedings of the KEOD 2009 - Proceedings of the International Conference on Knowledge Engineering and Ontology Development, Funchal, 2009

2003

Towards a semantics of proofs for non-commutative logic: multiplicatives and additives.

V. Michele Abrusci

Theor. Comput. Sci., 2003

Non Commutative Logic: A Survey.

V. Michele Abrusci

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2003

2002

Classical Conservative Extensions of Lambek Calculus.

V. Michele Abrusci

Stud Logica, 2002

1999

Tree Adjoining Grammars in a Fragment of the Lambek Calculus.

V. Michele Abrusci, Christophe Fouqueré, Jacqueline Vauzeilles

Comput. Linguistics, 1999

Non-Commutative Logic I: The Multiplicative Fragment.

V. Michele Abrusci, Paul Ruet

Ann. Pure Appl. Log., 1999

Modules in Non-communicative Logic.

V. Michele Abrusci

Proceedings of the Typed Lambda Calculi and Applications, 4th International Conference, 1999

1998

A New Correctness Criterion for Cyclic Proof Nets.

V. Michele Abrusci, Elena Maringelli

J. Log. Lang. Inf., 1998

1996

Tree Adjoining Grammars in Noncommutative Linear Logic.

V. Michele Abrusci, Christophe Fouqueré, Jacqueline Vauzeilles

Proceedings of the Logical Aspects of Computational Linguistics, 1996

1991

Phase Semantics and Sequent Calculus for Pure Noncommutative Classical Linear Propositional Logic.

V. Michele Abrusci

J. Symb. Log., 1991

1990

Non-commutative intuitionistic linear logic.

V. Michele Abrusci

Math. Log. Q., 1990

A comparison between lambek syntactic calculus and intuitionistic linear propositional logic.

V. Michele Abrusci

Math. Log. Q., 1990

Some Uses of Dilators in Combinatorial Problems, II.

V. Michele Abrusci, Jean-Yves Girard, Jacques Van de Wiele

J. Symb. Log., 1990

1989

A Logic of Recursion

V. Michele Abrusci, Gianfranco Mascari

Inf. Comput., May, 1989

Some uses of dilators in combinatorial problems - Part III. Independence results by means of decreasing<i>F</i>-sequences (<i>F</i> Weakly Finite Dilator).

V. Michele Abrusci

Arch. Math. Log., 1989