Alessio Mansutti

activity

20152026

most citedA Complete Axiomatisation for Quantifier-Free Separation Logic

6 citations · 8 across the 15 of their papers we have counts for

collaborators

Showing 2021Show all

2 papers · 1 filter

cs.LO2021

Notes on kAExp(pol) problems for deterministic machines

Alessio Mansutti

The complexity of several logics, such as Presburger arithmetic, dependence logics and ambient logics, can only be characterised in terms of alternating Turing machines. Despite qu…

cs.LO2021★ 1 cited

Presburger arithmetic with threshold counting quantifiers is easy

Dmitry Chistikov, Christoph Haase, Alessio Mansutti

We give a quantifier elimination procedures for the extension of Presburger arithmetic with a unary threshold counting quantifier $\exists^{\geq c} y$ that determines whether the nu…