# V. Michele Abrusci

According to our database

Collaborative distances:

^{1}, V. Michele Abrusci authored at least 26 papers between 1989 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Dataset Other## Links

#### On csauthors.net:

## Bibliography

2019

Math. Struct. Comput. Sci., 2019

2017

Stud Logica, 2017

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

FLAP, 2017

2016

Log. J. IGPL, 2016

2015

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

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

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

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

2014

J. Appl. Log., 2014

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

2013

Log. J. IGPL, 2013

CoRR, 2013

2011

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.

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.

Theor. Comput. Sci., 2003

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

2002

Stud Logica, 2002

1999

Tree Adjoining Grammars in a Fragment of the Lambek Calculus.

Comput. Linguistics, 1999

Ann. Pure Appl. Log., 1999

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

1998

J. Log. Lang. Inf., 1998

1996

Proceedings of the Logical Aspects of Computational Linguistics, 1996

1991

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

J. Symb. Log., 1991

1990

Math. Log. Q., 1990

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

Math. Log. Q., 1990

J. Symb. Log., 1990

1989

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).

Arch. Math. Log., 1989