Related papers: The finite cohesiveness principle
We show that when certain statements are provable in subsystems of constructive analysis using intuitionistic predicate calculus, related sequential statements are provable in weak classical subsystems. In particular, if a $\Pi^1_2$…
Let $\mathsf{KP}$ denote Kripke-Platek Set Theory and let $\mathsf{M}$ be the weak set theory obtained from $\mathsf{ZF}$ by removing the collection scheme, restricting separation to $\Delta_0$-formulae and adding an axiom asserting that…
The notion of weakly Laskerian modules was introduced recently by the authors. Let $R$ be a commutative Noetherian ring with identity, $\fa$ an ideal of $R$, and $M$ a weakly Laskerian module. It is shown that if $\fa$ is principal, then…
This article deals with the lower compactness property of a sequence of integrands and the use of this key notion in various domains: convergence theory, optimal control, non-smooth analysis. First about the interchange of the weak…
This work is motivated by the problem of finding the limit of the applicability of the first incompleteness theorem ($\sf G1$). A natural question is: can we find a minimal theory for which $\sf G1$ holds? We examine the Turing degree…
We show that there is a strong connection between Weihrauch reducibility on one hand, and provability in EL_0, the intuitionistic version of RCA_0, on the other hand. More precisely, we show that Weihrauch reducibility to the composition of…
Cousin's lemma is a compactness principle that naturally arises when studying the gauge integral, a generalisation of the Lebesgue integral. We study the axiomatic strength of Cousin's lemma for various classes of functions, using Friedman…
A relatively new topic in computability theory is the study of notions of computation that are robust against mistakes on some kind of small set. However, despite the recent popularity of this topic relatively foundational questions about…
Godel's First Incompleteness Theorem is generalized to definable theories, which are not necessarily recursively enumerable, by using a couple of syntactic-semantic notions, one is the consistency of a theory with the set of all true…
We prove decidability of the boundedness problem for monadic least fixed-point recursion based on positive monadic second-order (MSO) formulae over trees. Given an MSO-formula phi(X,x) that is positive in X, it is decidable whether the…
We analyze the strength of Helly's selection theorem HST, which is the most important compactness theorem on the space of functions of bounded variation. For this we utilize a new representation of this space intermediate between $L_1$ and…
Kobayashi-Ochiai's theorem says us that the set of dominant rational maps to a complex variety of general type is finite. In this paper, we give a generalization of it in the category of log schemes.
We investigate infinitary wellfounded systems for linear logic with fixed points, with transfinite branching rules indexed by some closure ordinal $\alpha$ for fixed points. Our main result is that provability in the system for some…
We introduce a theory of finite polynomial cohomology with coefficients in this paper. We prove several basic properties and introduce an Abel-Jacobi map with coefficients. As applications, we use such a cohomology theory to study…
A rigidity property for the homotopy invariant stable linear framed presheaves is established. As a consequence a variant of Gabber rigidity theorem is obtained for a cohomology theory representable in the motivic stable homotopy category…
We prove two completeness results, one for the extension of dependence logic by a monotone generalized quantifier Q with weak interpretation, weak in the meaning that the interpretation of Q varies with the structures. The second result…
We show that the well-known Konig's Min-Max Theorem (KMM), a fundamental result in combinatorial matrix theory, can be proven in the first order theory $\LA$ with induction restricted to $\Sigma_1^B$ formulas. This is an improvement over…
We consider the strength and effective content of restricted versions of Hindman's Theorem in which the number of colors is specified and the length of the sums has a specified finite bound. Let $\mathsf{HT}^{\leq n}_k$ denote the assertion…
We deal with a class of Lipschitz vector functions $U=(u_1,...,u_h)$ whose components are non negative, disjointly supported and verify an elliptic equation on each support. Under a weak formulation of a reflection law, related to the…
We introduce a technique for proving quantitative representation stability theorems for sequences of representations of certain finite linear groups over a field of characteristic zero. In particular, we prove a vanishing result for higher…