Related papers: Proving Properties of $\varphi$-Representations wi…
A formula $\phi$ is called \emph{$n$-provable} in a formal arithmetical theory $S$ if $\phi$ is provable in $S$ together with all true arithmetical $\Pi_{n}$-sentences taken as additional axioms. While in general the set of all $n$-provable…
Automated theorem proving has long been a key task of artificial intelligence. Proofs form the bedrock of rigorous scientific inquiry. Many tools for both partially and fully automating their derivations have been developed over the last…
We show that a special case of the Feferman-Vaught composition theorem gives rise to a natural notion of automata for finite words over an infinite alphabet, with good closure and decidability properties, as well as several logical…
The study of Whittaker models for representations of reductive groups over local and global fields has become a central tool in representation theory and the theory of automorphic forms. However, only generic representations have Whittaker…
We present a direct derivation of the theorem of M. Maxwell and M. Woodroofe (Ann. Probab. 28 (2000) 713-724), on martingale approximation of additive functionals of stationary Markov processes, from the non-reversible version of the…
First-order logic is a natural way of expressing properties of computation. It is traditionally used in various program logics for expressing the correctness properties and certificates. Although such representations are expressive for some…
The seminal book of Gusfield and Irving [GI89] provides a compact and algorithmically useful way to represent the collection of stable matches corresponding to a given set of preferences. In this paper, we reinterpret the main results of…
This paper attempts to address the question of how best to assure the correctness of saturation-based automated theorem provers using our experience developing the theorem prover Vampire. We describe the techniques we currently employ to…
Based on various strategies and a new general doubling operator, we obtain several simple proofs of the celebrated Sharkovsky's cycle coexistence theorem. A simple non-directed graph proof which is especially suitable for a calculus course…
We provide a general theorem on the asymptotic behavior of stochastic processes that conform to a relaxed supermartingale condition. The distinguishing feature of our result is that it provides quantitative convergence guarantees at a much…
A new approach to the theory of polynomial solutions of q - difference equations is proposed. The approach is based on the representation theory of simple Lie algebras and their q - deformations and is presented here for U_q(sl(n)). First a…
Sampling and reconstruction of functions is a central tool in science. A key result is given by the sampling theorem for bandlimited functions attributed to Whittaker, Shannon, Nyquist, and Kotelnikov. We develop an analogous sampling…
In the first part of this paper, we give a new analytical proof of a theorem of C. Sabbah on integrable deformations of meromorphic connections on $\mathbb P^1$ with coalescing irregular singularities of Poincar\'e rank 1, and generalizing…
We collect in this note some observations about original Welschinger invariants of real symplectic fourfolds. None of their proofs is difficult, nevertheless these remarks do not seem to have been made before. Our main result is that when…
This paper is a contribution to the theory of dynamical sampling. Our purpose is twofold. We first consider representations of sequences in a Hilbert space in terms of iterated actions of a bounded linear operator. This generalizes recent…
We introduce presheaf automata as a generalisation of different variants of higher-dimensional automata and other automata-like formalisms, including Petri nets and vector addition systems. We develop the foundations of a language theory…
This talk describes how a combination of symbolic computation techniques with first-order theorem proving can be used for solving some challenges of automating program analysis, in particular for generating and proving properties about the…
The original proof of the Sharkovsky theorem is presented in full detail. The proof should be accessible to readers with basic Real Analysis background. Although nowadays there are several alternative proofs of this classical result, we…
Methods for specifying Moore type state machines (transducers) abstractly via primitive recursive functions and for defining parallel composition via simultaneous primitive recursion are discussed. The method is mostly of interest as a…
We express generalized Cauchy-Stieltjes transforms of some particular Beta distributions (of ultraspherical type generating functions for orthogonal polynomials) as a powered Cauchy-Stieltjes transform of some measure. For suitable values…