research
∙
09/01/2023
Intuitionistic Gödel-Löb logic, à la Simpson: labelled systems and birelational semantics
We derive an intuitionistic version of Gödel-Löb modal logic (GL) in the...
share
research
∙
05/13/2023
MetaMorphosis: Task-oriented Privacy Cognizant Feature Generation for Multi-task Learning
With the growth of computer vision applications, deep learning, and edge...
research
∙
02/28/2023
Computational expressivity of (circular) proofs with fixed points
We study the computational expressivity of proof systems with fixed poin...
research
∙
11/29/2022
Non-uniform complexity via non-wellfounded proofs
Cyclic and non-wellfounded proofs are now increasingly employed to estab...
research
∙
05/17/2022
Cyclic Proofs, Hypersequents, and Transitive Closure Logic
We propose a cut-free cyclic system for Transitive Closure Logic (TCL) b...
research
∙
11/09/2021
Enumerating Independent Linear Inferences
A linear inference is a valid inequality of Boolean algebra in which eac...
research
∙
10/03/2021
Cyclic Implicit Complexity
Circular (or cyclic) proofs have received increasing attention in recent...
research
∙
02/12/2021
Proof complexity of positive branching programs
We investigate the proof complexity of systems based on positive branchi...
research
∙
12/28/2020
A circular version of Gödel's T and its abstraction complexity
Circular and non-wellfounded proofs have become an increasingly popular ...
research
∙
04/27/2020
Beyond formulas-as-cographs: an extension of Boolean logic to arbitrary graphs
We propose a graph-based extension of Boolean logic called Boolean Graph...
research
∙
10/18/2019
Proof complexity of systems of (non-deterministic) decision trees and branching programs
This paper studies propositional proof systems in which lines are sequen...
research
∙
06/09/2019
From QBFs to MALL and back via focussing: fragments of multiplicative additive linear logic for each level of the polynomial hierarchy
In this work we investigate how to extract alternating time bounds from ...
research
∙
03/14/2019
A Functional (Monadic) Second-Order Theory of Infinite Trees
This paper presents a complete axiomatization of Monadic Second-Order Lo...
research
∙
07/26/2018
On the logical complexity of cyclic arithmetic
We study the logical complexity of proofs in cyclic arithmetic (CA), as ...
research
∙
10/07/2014
