V. Michele Abrusci

From MaRDI portal
Person:280841

Available identifiers

zbMath Open abrusci.vito-micheleMaRDI QIDQ280841

List of research outcomes





PublicationDate of PublicationType
Lambek’s Syntactic Calculus and Noncommutative Variants of Linear Logic: Laws and Proof-Nets2021-12-08Paper
Proof nets for multiplicative cyclic linear logic and Lambek calculus2019-05-27Paper
Analytic and synthetic in logic2019-01-08Paper
Logica2018-03-09Paper
A geometrical representation of the basic laws of categorial grammar2017-07-19Paper
Cyclic Multiplicative-Additive Proof Nets of Linear Logic with an Application to Language Parsing2016-12-01Paper
Formal ontologies and coherent spaces2016-05-10Paper
Cyclic Multiplicative Proof Nets of Linear Logic with an Application to Language Parsing2015-09-24Paper
Universal vs. particular reasoning: a study with neuroimaging techniques2015-02-24Paper
On Hilbert's Axiomatics of Propositional Logic2014-07-22Paper
On Residuation2014-05-08Paper
Logica2014-03-31Paper
Ontologies and coherence spaces2011-03-04Paper
https://portal.mardi4nfdi.de/entity/Q56988712007-02-01Paper
Towards a semantics of proofs for non-commutative logic: Multiplicatives and additives2003-07-29Paper
Classical conservative extensions of Lambek calculus2002-12-15Paper
Non-commutative logic. I: The multiplicative fragment2001-06-04Paper
https://portal.mardi4nfdi.de/entity/Q42638582000-02-28Paper
A new correctness criterion for cyclic proof nets1999-02-17Paper
https://portal.mardi4nfdi.de/entity/Q43702361998-06-14Paper
https://portal.mardi4nfdi.de/entity/Q48429781995-12-18Paper
https://portal.mardi4nfdi.de/entity/Q46942321993-06-29Paper
https://portal.mardi4nfdi.de/entity/Q40035211993-01-23Paper
Phase semantics and sequent calculus for pure noncommutative classical linear propositional logic1992-06-27Paper
Non‐commutative intuitionistic linear logic1992-06-25Paper
A comparison between lambek syntactic calculus and intuitionistic linear propositional logic1990-01-01Paper
Some uses of dilators in combinatorial problems. II1990-01-01Paper
Some uses of dilators in combinatorial problems. III: Independence results by means of decreasing F-sequences (F weakly finite dilator)1989-01-01Paper
A logic of recursion1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37722131987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37722141987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38190571987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37441571985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37539991985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36719651983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37705271983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39014911981-01-01Paper

Research outcomes over time

This page was built for person: V. Michele Abrusci