Some remarks on the convergence of the Dirichlet series of L-functions and related questions

First we show that the abscissae of uniform and absolute convergence of Dirichlet series coincide in the case of $L$-functions from the Selberg class $\mathcal{S}$. We also study the latter abscissa inside the extended Selberg class, indicating a different behavior in the two classes. Next we address two questions about majorants of functions in $\mathcal{S}$, showing links with the distribution of the zeros and with independence results.Comment: 10 page

Primes and prime ideals in short intervals

We prove the analog of Cram\'er's short intervals theorem for primes in arithmetic progressions and prime ideals, under the relevant Riemann Hypothesis. Both results are uniform in the data of the underlying structure. Our approach is based mainly on the inertia property of the counting functions of primes and prime ideals.Comment: minor change to Proposition

Checking Interval Properties of Computations

Model checking is a powerful method widely explored in formal verification. Given a model of a system, e.g., a Kripke structure, and a formula specifying its expected behaviour, one can verify whether the system meets the behaviour by checking the formula against the model. Classically, system behaviour is expressed by a formula of a temporal logic, such as LTL and the like. These logics are "point-wise" interpreted, as they describe how the system evolves state-by-state. However, there are relevant properties, such as those constraining the temporal relations between pairs of temporally extended events or involving temporal aggregations, which are inherently "interval-based", and thus asking for an interval temporal logic. In this paper, we give a formalization of the model checking problem in an interval logic setting. First, we provide an interpretation of formulas of Halpern and Shoham's interval temporal logic HS over finite Kripke structures, which allows one to check interval properties of computations. Then, we prove that the model checking problem for HS against finite Kripke structures is decidable by a suitable small model theorem, and we provide a lower bound to its computational complexity.Comment: In Journal: Acta Informatica, Springer Berlin Heidelber, 201

On the structure of the Selberg class, IV: basic invariants

n/