Related papers: Ruitenburg's Theorem via Duality and Bounded Bisim…

A simple method called symbolic representation for piecewise linear functions on the real line is introduced and used to compute the numbers of periodic points of all periods for some such functions. Since, for every positive integer m, the…

We propose four axiomatic systems for intuitionistic linear temporal logic and show that each of these systems is sound for a class of structures based either on Kripke frames or on dynamic topological systems. Our topological semantics…

An infinite sequence $\langle{u_n}\rangle_{n\in\mathbb{N}}$ of real numbers is holonomic (also known as P-recursive or P-finite) if it satisfies a linear recurrence relation with polynomial coefficients. Such a sequence is said to be…

Modal dependence logic was introduced recently by V\"a\"an\"anen. It enhances the basic modal language by an operator =(). For propositional variables p_1,...,p_n, =(p_1,...,p_(n-1);p_n) intuitively states that the value of p_n is…

Many representation schemes combining first-order logic and probability have been proposed in recent years. Progress in unifying logical and probabilistic inference has been slower. Existing methods are mainly variants of lifted variable…

The first-order theory of addition over the natural numbers, known as Presburger arithmetic, is decidable in double exponential time. Adding an uninterpreted unary predicate to the language leads to an undecidable theory. We sharpen the…

The infinitary propositional logic of here-and-there is important for the theory of answer set programming in view of its relation to strongly equivalent transformations of logic programs. We know a formal system axiomatizing this logic…

For any noncocompact Fuchsian group $\Gamma$, we show that periods of the canonical differential of the third kind associated to residue divisors of cusps are expressed in terms of Rademacher symbols for $\Gamma$ - generalizations of…

We present a formalization of a version of Abadi and Plotkin's logic for parametricity for a polymorphic dual intuitionistic/linear type theory with fixed points, and show, following Plotkin's suggestions, that it can be used to define a…

We study propositional logical systems arising from the language of Johansson's minimal logic and obtained by weakening the requirements for the negation operator. We present their semantics as a variant of neighbourhood semantics. We use…

Let rho be a Drinfeld A-module with generic characteristic defined over an algebraic function field. We prove that all of the algebraic relations among periods, quasi-periods, and logarithms of algebraic points on rho are those coming from…

This paper introduces the counterpart of strong bisimilarity for labelled transition systems extended with time-out transitions. It supports this concept through a modal characterisation, congruence results for a standard process algebra…

We provide a formal, simple and intuitive theory of rational decision making including sequential decisions that affect the environment. The theory has a geometric flavor, which makes the arguments easy to visualize and understand. Our…

The degree sequence of the algebraic numbers in an algebraic linear recurrence sequence is shown to be virtually periodic. This is proved using the Skolem-Mahler-Lech theorem. It has applications to the degree sequence and the minimal…

The provability logic of a theory $T$ captures the structural behavior of formalized provability in $T$ as provable in $T$ itself. Like provability, one can formalize the notion of relative interpretability giving rise to interpretability…

Let $\Lambda$ be a $\mathbb{Z}$-graded artin algebra. Two classical results of Gordon and Green state that if $\Lambda$ has only finitely many indecomposable gradable modules, up to isomorphism, then $\Lambda$ has finite representation…

Within the program of finding axiomatizations for various parts of computability logic, it was proved earlier that the logic of interactive Turing reduction is exactly the implicative fragment of Heyting's intuitionistic calculus. That sort…

One interpretation of Torelli's Theorem, which asserts that a compact Riemann Surface $X$ of genus $g > 1$ is determined by the $g(g+1)/2$ entries of the period matrix, is that the period matrix is a message about $X$. Since this message…

A probabilistic propositional logic, endowed with an epistemic component for asserting (non-)compatibility of diagonizable and bounded observables, is presented and illustrated for reasoning about the random results of projective…

In probabilistic transition systems, behavioural metrics provide a more fine-grained and stable measure of system equivalence than crisp notions of bisimilarity. They correlate strongly to quantitative probabilistic logics, and in fact the…