Related papers: The problem of Pi_2-cut-introduction

In this thesis, we present two approaches to a rigorous mathematical and algorithmic foundation of quantitative and statistical inference in constraint-based natural language processing. The first approach, called quantitative constraint…

We propose a primal-dual backward reflected forward splitting method for solving structured primal-dual monotone inclusion in real Hilbert space. The algorithm allows to use the inexact computations of the Lipschitzian and cocoercive…

This paper provides an NP procedure that decides whether a linear-exponential system of constraints has an integer solution. Linear-exponential systems extend standard integer linear programs with exponential terms $2^x$ and remainder terms…

We propose a simple and easy to implement neural network compression algorithm that achieves results competitive with more complicated state-of-the-art methods. The key idea is to modify the original optimization problem by adding K…

We describe an algorithm for computing certain quaternionic quotients of the Bruhat-Tits tree for GL2(Qp). As an application, we describe an algorithm to obtain (conjectural) equations for the canonical embedding of Shimura curves.

We provide a new sequent calculus that enjoys syntactic cut-elimination and strongly terminating backward proof search for the intuitionistic Strong L\"ob logic $\sf{iSL}$, an intuitionistic modal logic with a provability interpretation. A…

We compactify M(atrix) theory on Riemann surfaces Sigma with genus g>1. Following [1], we construct a projective unitary representation of pi_1(Sigma) realized on L^2(H), with H the upper half-plane. As a first step we introduce a suitably…

We develop a second-order extension of intuitionistic modal logic, allowing quantification over propositions, both syntactically and semantically. A key feature of second-order logic is its capacity to define positive connectives from the…

We prove that $L^2$ weak solutions to hypoelliptic equations with bounded measurable coefficients are H\"older continuous. The proof relies on classical techniques developed by De Giorgi and Moser together with the averaging lemma and…

G3-style sequent calculi for the logics in the cube of non-normal modal logics and for their deontic extensions are studied. For each calculus we prove that weakening and contraction are height-preserving admissible, and we give a syntactic…

For relational monadic formulas (the L\"owenheim class) second-order quantifier elimination, which is closely related to computation of uniform interpolants, projection and forgetting - operations that currently receive much attention in…

We introduce GCIS, a grammar compression algorithm based on the induced suffix sorting algorithm SAIS, introduced by Nong et al. in 2009. Our solution builds on the factorization performed by SAIS during suffix sorting. We construct a…

We study cut elimination for a multifocused variant of full linear logic in the sequent calculus. The multifocused normal form of proofs yields problems that do not appear in a standard focused system, related to the constraints in grouping…

We exhibit a uniform method for obtaining (wellfounded and non-wellfounded) cut-free sequent-style proof systems that are sound and complete for various classes of action algebras, i.e., Kleene algebras enriched with meets and residuals.…

We analyze Coquand's game-theoretic interpretation of Peano Arithmetic through the lens of elementary descent recursion. In Coquand's game semantics, winning strategies correspond to infinitary cut-free proofs and cut elimination…

This paper presents a cut-elimination proof for the logic $LG^\omega$, which is an extension of a proof system for encoding generic judgments, the logic $\FOLDNb$ of Miller and Tiu, with an induction principle. The logic $LG^\omega$, just…

We introduce a geometric model of shallow multiplicative exponential linear logic (MELL) using the Hilbert scheme. Building on previous work interpreting multiplicative linear logic proofs as systems of linear equations, we show that…

This manuscript bridges nonparametric smoothness-based and shape-restricted estimation, which may appear as two disjoint paradigms in the field. The proposed approach is motivated by a conceptually simple observation: every Lipschitz…

In "Cut Elimination for Gentzen's Sequent Calculus with Equality and Logic of Partial Terms" LNCS 7750,161-172(2013), we have shown that the cut rule is eliminable in two ground equational sequent calculi, to be denoted by EQ_M and EQ'. In…

Let H be any reductive p-adic group. We introduce a notion of cuspidality for enhanced Langlands parameters for H, which conjecturally puts supercuspidal H-representations in bijection with such L-parameters. We also define a cuspidal…