Related papers: Classical and Effective Descriptive Complexities o…
A nilpotent orbit $O$ of a complex semisimple Lie algebra $\mathfrak{g}$ has finite fundamental group. Associated with an etale cover of $O$, we have a finite cover of the closure $\bar{O}$ of $O$. In this article we consider the finite…
We investigate the strength of the existence of a non-principal ultrafilter over fragments of higher order arithmetic. Let U be the statement that a non-principal ultrafilter exists and let ACA_0^{\omega} be the higher order extension of…
We identify a structural property of term-rewriting proof systems called operational inexpressibility: no derivation depends on a specified input dimension and also constrains the target question. The canonical instance is direct…
We study the computational strength of resetting $\alpha$-register machines, a model of transfinite computability introduced by P. Koepke in \cite{K1}. Specifically, we prove the following strengthening of a result from \cite{C}: For an…
We investigate structures that can be represented by omega-automata, so called omega-automatic structures, and prove that relations defined over such structures in first-order logic expanded by the first-order quantifiers `there exist at…
We suggest to look at formal sentences describing complex algebraic varieties together with their universal covers as topological invariants. We prove that for abelian varieties and Shimura varieties this is indeed a complete invariant,…
We fully classify automatic sequences $a$ over a finite alphabet $\Omega$ with the property that each word over $\Omega$ appears is $a$ along an arithmetic progression. Using the terminology introduced by Avgustinovich, Fon-Der-Flaass and…
We give an alternative proof of a fact that a finite continuous non-decreasing submodular set function on a measurable space can be expressed as a supremum of measures dominated by the function, if there exists a class of sets which is…
This paper is the extended version of On the Complexity of Infinite Advice Strings (ICALP 2018). We investigate a notion of comparison between infinite strings. In a general way, if M is a computation model (e.g. Turing machines) and C a…
We develop a theory of k-partitions of the set of infinite words recognizable by classes of finite automata. The theory enables to complete proofs of existing results about topological classifications of the (aperiodic) omega-regular…
We prove that the set of all integrable functions whose sequences of negative (resp. nonnegative) Fourier coefficients belong to $\ell^1\cap\ell^\Phi_{\phi,w}$ (resp. to $\ell^1\cap\ell^\Psi_{\psi,\varrho}$), where $\ell^\Phi_{\phi,w}$ and…
A result of Kaufmann shows that if $L_\alpha$ is countable, admissible and satisfies $\Pi_n\textsf{-Collection}$, then $\langle L_\alpha, \in \rangle$ has a proper $\Sigma_{n+1}$-elementary end extension. This paper investigates to what…
A classical tool in the study of real closed fields are the fields $K((G))$ of generalized power series (i.e., formal sums with well-ordered support) with coefficients in a field $K$ of characteristic 0 and exponents in an ordered abelian…
For each countable ordinal $\alpha$, we introduce an ideal $conv_\alpha$ and use it to characterize the class of all compact countable spaces which are homeomorphic to the space $\omega^{\alpha}\cdot n+1$ with the order topology. The…
We classify the computability-theoretic complexity of two index sets of classes of first-order theories: We show that the property of being an $\aleph_0$-categorical theory is $\Pi^0_3$-complete; and the property of being an Ehrenfeucht…
We introduce a subclass of linear recurrence sequences which we call poly-rational sequences because they are denoted by rational expressions closed under sum and product. We show that this class is robust by giving several…
Our concern is the problem of determining the data complexity of answering an ontology-mediated query (OMQ) formulated in linear temporal logic LTL over (Z,<) and deciding whether it is rewritable to an FO(<)-query, possibly with some extra…
For each ordinal $0\leqslant \xi\leqslant \omega_1$, we introduce the notion of a $\xi$-completely continuous operator and prove that for each ordinal $0< \xi< \omega_1$, the class $\mathfrak{V}_\xi$ of $\xi$-completely continuous operators…
The signature of closed oriented manifolds is well-known to be multiplicative under finite covers. This fails for Poincar\'e complexes as examples of C. T. C. Wall show. We establish the multiplicativity of the signature, and more…
Indexed languages are a classical notion in formal language theory, which has attracted attention in recent decades due to its role in higher-order model checking: They are precisely the languages accepted by order-2 pushdown automata. The…