Monotonicity in Logic and Complexity

Informazioni relative al progetto

MiLC

ID dell’accordo di sovvenzione: 753431

DOI

10.3030/753431

Progetto chiuso

Data della firma CE 17 Marzo 2017

Data di avvio 1 Settembre 2017

Data di completamento 31 Agosto 2019

Finanziato da

• EXCELLENT SCIENCE - Marie Skłodowska-Curie Actions

Costo totale

€ 200 194,80

Contributo UE

€ 200 194,80

Coordinato da

KOBENHAVNS UNIVERSITET
Denmark

Periodic Reporting for period 1 - MiLC (Monotonicity in Logic and Complexity)

Periodo di rendicontazione: 2017-09-01 al 2019-08-31

Sintesi del contesto e degli obiettivi generali del progetto

This project studied logical characterisations of monotone complexity classes. Monotone computation is all around us, and more or less corresponds to 'computing without flipping bits'. Such models are used for a wide variety of mathematical and computational problems, such as sorting a list or detecting cliques in graphs. Naturally it is important to understand the resource usage, or complexity, of programs in these models. To this end, we developed novel approaches using proof theory and recursion theory, to establish comprehensive logical frameworks for reasoning about monotone computation and complexity.

Lavoro eseguito dall’inizio del progetto fino alla fine del periodo coperto dalla relazione e principali risultati finora ottenuti

Togther with Isabel Oitvaem, I have developed monotone functional models of computation inspired by the previous work of Grigni & Sipser and Lautemann, Schwentick & Stewart. We have furthermore given recursion theoretic characterisations in the form of function algebras that smoothly scale to other classes by a simple uniformity constraint.

I have developed a full monotone version of Cook's correspondence, for monotone polynomial time, unifying monotone circuit complexity, monotone proof complexity and monotone models of computation via a logical correspondence. As a result I was able to arrive at alternative proofs and generalised results in proof complexity. Some of these ideas and methods were also applied in joint work with Buss and Knop for the proof complexity of branching programs and logspace computation.

Progressi oltre lo stato dell’arte e potenziale impatto previsto (incluso l’impatto socioeconomico e le implicazioni sociali più ampie del progetto fino ad ora)

Beyond the current state of the art, I expect that the substructural direction will develop over the next few years via PhD students and collaborators. This remains the missing piece for unifying different communities in implicit complexity, namely linear logic and proof complexity. Eventually I hope these developments will be implemented via proof assistants such as Coq, whereby monotone programs with controled resources may be synthesised for general use.

logo.png