Related papers: On the Expressiveness of B\"uchi Arithmetic
In this paper we establish new integral representations for the remainder term of the known asymptotic expansion of the logarithm of the Barnes $G$-function. Using these representations, we obtain explicit and numerically computable error…
By using the abstract structures investigated in the first Part of this article, we develop a semantics for an epistemic language, which expresses sentences like "Alice knows that Bob does not understand that PI is irrational". One is…
We study expressibility in infinitary languages of the modal operators associated with satisfiability of sentences of these languages in submodels and extensions of models. We give a syntactic criterion for expressibility in finitary…
In this paper we address the decision problem for a fragment of set theory with restricted quantification which extends the language studied in [4] with pair related quantifiers and constructs, in view of possible applications in the field…
Given a parametrised weight function $\omega(x,\mu)$ such that the quotients of its consecutive moments are M\"obius maps, it is possible to express the underlying biorthogonal polynomials in a closed form \cite{IN2}. In the present paper…
During the last decades, a lot of effort was put into identifying decidable fragments of first-order logic. Such efforts gave birth, among the others, to the two-variable fragment and the guarded fragment, depending on the type of…
We show that deciding whether an argument a is stronger than an argument b with respect to the discussion-based semantics of Amgoud and Ben-Naim is decidable in polynomial time. At its core, this problem is about deciding whether, for two…
In this paper we study the asymptotic behavior of solutions of fractional differential equations of the form $D^{\alpha}_Cu(t)=Au(t)+f(t)$ on the half line, where $D^{\alpha}_Cu(t)$ is the derivative of the function $u$ in Caputo's sense,…
We give a purely complex geometric proof of the existence of the Bergman kernel expansion. Our method provides a sharper estimate, and in the case that the metrics are real analytic, we prove that the remainder decays faster than any…
Graph-based semantic representations are valuable in natural language processing, where it is often simple and effective to represent linguistic concepts as nodes, and relations as edges between them. Several attempts has been made to find…
Our main result is that any real cubic algebraic number has a continued fraction expansion with polynomial coefficients. Some generalizations are mentioned.
In the last years, various extensions of {\omega}-regular languages have been proposed in the literature, including {\omega}B-regular ({\omega}-regular languages extended with boundedness), {\omega}S-regular ({\omega}-regular languages…
Expressions are given for the exponential of a hermitian matrix, A. Replacing A by iA these are explicit formulas for the Fourier transform of exp(iA). They extend to any size matrix the previous results for the 2 X 2, 3 X 3, and 4 X 4…
This paper revisits the well-established relationship between the modal mu calculus and parity games to show that it is even more robust than previously known. It addresses the question of whether the descriptive complexity of modal mu…
In this paper we study the asymptotic behaviour of two relatively new complexity functions defined on infinite words and their relationship to periodicity. Given a factor $u$ of an infinite word $x$, we say $u$ is closed if it is a letter…
We prove that the moduli b-divisor of an lc-trivial fibration from a log canonical pair is log abundant. The result follows from a theorem on the restriction of the moduli b-divisor, based on a theory of lc-trivial morphisms, which allows…
We study the ($\omega$-)regular separability problem for B\"uchi VASS languages: Given two B\"uchi VASS with languages $L_1$ and $L_2$, check whether there is a regular language that fully contains $L_1$ while remaining disjoint from $L_2$.…
B\"uchi's theorem states that $\omega$-regular languages are characterized as languages of the form $\bigcup_i U_i V_i^\omega$, where $U_i$ and $V_i$ are regular languages. Parikh automata are automata on finite words whose transitions are…
We provide an upper bound on the efficient irrationality exponents of cubic algebraics $x$ with the minimal polynomial $x^3 - tx^2 - a$. In particular, we show that it becomes non-trivial, i.e. better than the classical bound of Liouville…
We present a completeness result for the implicit fragment of justification stit logic. Although this fragment allows for no strongly complete axiomatization, we show that a restricted form of strong completeness (subsuming weak…