相关论文: Unprovability of circuit upper bounds in Cook's th…

We show that there is a constant $k$ such that Buss's intuitionistic theory $\mathsf{IS}^1_2$ does not prove that SAT requires co-nondeterministic circuits of size at least $n^k$. To our knowledge, this is the first unconditional…

While there has been progress in establishing the unprovability of complexity statements in lower fragments of bounded arithmetic, understanding the limits of Je\v{r}\'abek's theory $APC_1$ (2007) and of higher levels of Buss's hierarchy…

As far as I know, at the time that I originally devised this result (1998), this was the first constructive proof that, for any integer $k$, there is a language in $\Sigma_2^P$ that cannot be simulated by a family of logic circuits of size…

For a non-negative integer $k$, a language is $k$-piecewise test\-able ($k$-PT) if it is a finite boolean combination of languages of the form $\Sigma^* a_1 \Sigma^* \cdots \Sigma^* a_n \Sigma^*$ for $a_i\in\Sigma$ and $0\le n \le k$. We…

We show that for any $i > 0$, it is decidable, given a regular language, whether it is expressible in the $\Sigma_i[<]$ fragment of first-order logic FO[<]. This settles a question open since 1971. Our main technical result relies on the…

We introduce a proof system for Hajek's logic BL based on a relational hypersequents framework. We prove that the rules of our logical calculus, called RHBL, are sound and invertible with respect to any valuation of BL into a suitable…

We prove for each integer $\ell\geq 1$ an unconditional upper bound for the size of the $\ell$-torsion subgroup $Cl_K[\ell]$ of the class group of $K$, which holds for all but a zero density set of number fields $K$ of degree $d\in\{4,5\}$…

We show that the Parikh image of the language of an NFA with n states over an alphabet of size k can be described as a finite union of linear sets with at most k generators and total size 2^{O(k^2 log n)}, i.e., polynomial for all fixed k…

We prove that the sequence $(N_k)_k$, where each $N_k$ is defined as the smallest positive integer $n$ for which the $n$th term $g_{k,n}$ of the $k$-G\"obel sequence is not an integer, is unbounded.

We consider first-order logic with monoidal quantifiers over words. We show that all languages with a neutral letter, definable using the addition numerical predicate are also definable with the order predicate as the only numerical…

A vector addition system (VAS) with an initial and a final marking and transition labels induces a language. In part because the reachability problem in VAS remains far from being well-understood, it is difficult to devise decision…

For each integer $\ell \geq 1$, we prove an unconditional upper bound on the size of the $\ell$-torsion subgroup of the class group, which holds for all but a zero-density set of field extensions of $\mathbb{Q}$ of degree $d$, for any fixed…

Given a finite-dimensional faithful representation $V$ of a linearly reductive group $G$ over a field $K=\bar K$, we consider the growth of the number of irreducible factors of $V^{\otimes n}$ when $n$ is large. We prove that there exist…

Proving proof-size lower bounds for $\mathbf{LK}$, the sequent calculus for classical propositional logic, remains a major open problem in proof complexity. We shed new light on this challenge by isolating the power of structural rules,…

A field $K$ in a ring language $\mathcal{L}$ is finitely undecidable if $\mbox{Cons}(\Sigma)$ is undecidable for every nonempty finite $\Sigma \subseteq \mbox{Th}(K; \mathcal{L})$. We adapt arguments originating with Cherlin-van den…

We prove that there are single Henkin quantifiers such that first order logic augmented by one of these quantifiers is undecidable in the empty vocabulary. Examples of such quantifiers are given.

A propositional proof system $P$ has the strong feasible disjunction property iff there is a constant $c \geq 1$ such that whenever $P$ admits a size $s$ proof of $\bigvee_i \alpha_i$ with no two $\alpha_i$ sharing an atom then one of…

Program logics are a powerful formal method in the context of program verification. Can we develop a counterpart of program logics in the context of language verification? This paper proposes language logics, which allow for statements of…

Unbounded {\L}ukasiewicz logic is a substructural logic that combines features of infinite-valued {\L}ukasiewicz logic with those of abelian logic. The logic is finitely strongly complete w.r.t.~the additive $\ell$-group on the reals…

The largest volume ratio of given convex body $K \subset \mathbb{R}^n$ is defined as $$\mbox{lvr}(K):= \sup_{L \subset \mathbb{R}^n} \mbox{vr}(K,L),$$ where the $\sup$ runs over all the convex bodies $L$. We prove the following sharp lower…