Related papers: Corrected Iteration
Given a cardinal $\kappa$ that is $\lambda$-supercompact for some regular cardinal $\lambda\geq\kappa$ and assuming $\GCH$, we show that one can force the continuum function to agree with any function $F:[\kappa,\lambda]\cap\REG\to\CARD$…
We present a new and compelling approach to the efficient solution of important computational problems that arise in the context of abstract argumentation. Our approach makes known algorithms defined for restricted fragments generally…
We provide a proof of strong normalisation for lambda+, a recently introduced, explicitly typed, non-deterministic lambda-calculus where isomorphic propositions are identified. Such a proof is a non-trivial adaptation of the reducibility…
Given a commensurated subgroup $\Lambda$ of a group $\Gamma$, we completely characterize when the inclusion $\Lambda\leq \Gamma$ is $C^*$-irreducible and provide new examples of such inclusions. In particular, we obtain that…
In this note we aim at putting more emphasis on the fact that trying to solve non-convex optimization problems with coordinate-descent iterative linear matrix inequality algorithms leads to suboptimal solutions, and put forward other…
In this paper we analyze several inexact fast augmented Lagrangian methods for solving linearly constrained convex optimization problems. Mainly, our methods rely on the combination of excessive-gap-like smoothing technique developed in…
Answer validation in machine reading comprehension (MRC) consists of verifying an extracted answer against an input context and question pair. Previous work has looked at re-assessing the "answerability" of the question given the extracted…
We study methods to obtain the consistency of forcing axioms, and particularly higher forcing axioms. We first force over a model with a supercompact cardinal $\theta>\kappa$ to get the consistency of the forcing axiom for $\kappa$-strongly…
The Lambek calculus can be considered as a version of non-commutative intuitionistic linear logic. One of the interesting features of the Lambek calculus is the so-called "Lambek's restriction," that is, the antecedent of any provable…
We combine several folklore observations to provide a working framework for iterating constructions which contradict the axiom of choice. We use this to define a model in which any kind of structural failure must fail with a proper class of…
In $e^+e^-$ shape-variable studies, and in particular for the case of thrust, fixed-order QCD predictions are typically supplemented with the resummation of contributions enhanced near the two-jet limit. In this work we examine whether…
Motivated by recent results of Kapron and Steinberg (LICS 2018) we introduce new forms of iteration on length in the setting of applied lambda-calculi for higher-type poly-time computability. In particular, in a type-two setting, we…
Compact U(1) theory in 4 dimensions is used to compare the modified iterative and the Laplacian fixing to lattice Landau gauge in a controlled setting, since in the Coulomb phase the lattice theory must reproduce the perturbative…
The primary focus of this paper is on designing an inexact first-order algorithm for solving constrained nonlinear optimization problems. By controlling the inexactness of the subproblem solution, we can significantly reduce the…
To construct interpretable explanations that are consistent with the original ML model, counterfactual examples---showing how the model's output changes with small perturbations to the input---have been proposed. This paper extends the work…
In our paper "Uniformity and the Taylor expansion of ordinary lambda-terms" (with Laurent Regnier), we studied a translation of lambda-terms as infinite linear combinations of resource lambda-terms, from a calculus similar to Boudol's…
Let GCH hold and let $j:V\longrightarrow M$ be a definable elementary embedding such that $crit(j)=\kappa$, $^{\kappa}M\subseteq M$ and $\kappa^{++}=\kappa_{M}^{++}$. H. Woodin proved that there is a cofinality preserving generic extension…
A cardinal lambda is called omega-inaccessible if for all mu < lambda we have mu^omega<lambda. We show that for every omega-inaccessible cardinal lambda there is a CCC (hence cardinality and cofinality preserving) forcing that adds a…
This paper concerns extension of the classical Lagrange theorem, on the eventual periodicity of continued fraction expansions of quadratic surds, and the versions of it found in the literature in the case of complex numbers. In this…
This paper develops a computational model of paraphrase under which text modification is carried out reluctantly; that is, there are external constraints, such as length or readability, on an otherwise ideal text, and modifications to the…