Related papers: Capturing the polynomial hierarchy by second-order…

After reviewing various natural bi-interpretations in urelement set theory, including second-order set theories with urelements, we explore the strength of second-order reflection in these contexts. Ultimately, we prove, second-order…

We study first-order logic over unordered structures whose elements carry a finite number of data values from an infinite domain which can be compared wrt. equality. As the satisfiability problem for this logic is undecidable in general, in…

The classical Kepler-Coulomb system in 3 dimensions is well known to be 2nd order superintegrable, with a symmetry algebra that closes polynomially under Poisson brackets. This polynomial closure is typical for 2nd order superintegrable…

In this manuscript we provide a new polynomial pattern. This pattern allows to find a polynomial expansion of the form \[x^{2m+1} = \sum_{k=1}^{x}\sum_{r=0}^{m} \mathbf{A}_{m,r} k^r (x-k)^r,\] where $x,m\in\mathbb{N}$ and $\mathbf{A}_{m,r}$…

The celebrated Trakhtenbrot's theorem states that the set of finitely valid sentences of first-order logic is not computably enumerable. In this note we will extend this theorem by proving that the finite satisfiability problem of any…

We investigate the decidability of the definability problem for fragments of first order logic over finite words enriched with modular predicates. Our approach aims toward the most generic statements that we could achieve, which…

Hodge-filtered derived de Rham cohomology of a ring $R$ can be described (up to completion and shift) as the graded pieces of the even filtration on $\mathrm{HC}^-(R)$. In this paper we show a deformation of this result: If $R$ admits a…

We study a structure of subcategories which are called a polygon of recollements in a triangulated category. First, we study a $2n$-gon of recollements in an $(m/n)$-Calabi-Yau triangulated category. Second, we show the homotopy category…

We study extensions of expressive decidable fragments of first-order logic with circumscription, in particular the two-variable fragment FO$^2$, its extension C$^2$ with counting quantifiers, and the guarded fragment GF. We prove that if…

For a reduced hyperplane arrangement we prove the analytic Twisted Logarithmic Comparison Theorem, subject to mild combinatorial arithmetic conditions on the weights defining the twist. This gives a quasi-isomorphism between the twisted…

In this paper, we study the sampling problem for first-order logic proposed recently by Wang et al. -- how to efficiently sample a model of a given first-order sentence on a finite domain? We extend their result for the…

We define a cohomology for an arbitrary $K$-linear semistrict semigroupal 2-category $(\mathfrak{C},\otimes)$ (called in the paper a Gray semigroup) and show that its first order (unitary) deformations, up to the suitable notion of…

We compute the equivariant $KO$-homology of the classifying space for proper actions of $\textrm{SL}_3(\mathbb{Z})$ and $\textrm{GL}_3(\mathbb{Z})$. We also compute the Bredon homology and equivariant $K$-homology of the classifying spaces…

This article shows that there exist two particular linear orders such that first-order logic with these two linear orders has the same expressive power as first-order logic with the Bit-predicate FO(Bit). As a corollary we obtain that there…

We study rational homology groups of one-point compactifications of spaces of complex monic polynomials with multiple roots. These spaces are indexed by number partitions. A standard reformulation in terms of quotients of orbit arrangements…

We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…

In this article we show that hybrid type-logical grammars are a fragment of first-order linear logic. This embedding result has several important consequences: it not only provides a simple new proof theory for the calculus, thereby…

We consider the satisfiability problem for the two-variable fragment of first-order logic over finite unranked trees. We work with signatures consisting of some unary predicates and the binary navigational predicates child, right sibling,…

We make some computations in stable motivic homotopy theory over Spec \mathbb{C}, completed at 2. Using homotopy fixed points and the algebraic K-theory spectrum, we construct a motivic analogue of the real K-theory spectrum KO. We also…

We propose a fragment of many-sorted second order logic called EQSMT and show that checking satisfiability of sentences in this fragment is decidable. EQSMT formulae have an $\exists^*\forall^*$ quantifier prefix (over variables, functions…