Related papers: Encoding Sequences in Intuitionistic Real Algebra
In this paper we present a formalization of Intuitionistic Propositional Logic in the Lean proof assistant. Our approach focuses on verifying two completeness proofs for the studied logical system, as well as exploring the relation between…
We had recently shown that every positive integer can be represented uniquely using a recurrence sequence, when certain restrictions on the digit strings are satisfied. We present the details of how such representations can be used to build…
Recursive calls over recursive data are useful for generating probability distributions, and probabilistic programming allows computations over these distributions to be expressed in a modular and intuitive way. Exact inference is also…
Let $R$ be a commutative ring with identity and a fixed invertible element $q^{\frac{1}{2}}$, and suppose $q+q^{-1}$ is invertible in $R$. For each planar surface $\Sigma_{0,n+1}$, we present its Kauffman bracket skein algebra over $R$ by…
In an impressive series of papers, Krivine showed at the edge of the last decade how classical realizability provides a surprising technique to build models for classical theories. In particular, he proved that classical realizability…
We survey recent results on the representation theory of symplectic reflection algebras, focusing particularly on connections with symplectic quotient singularities and their resolutions, spaces of representations of quivers, and on…
We prove that the uniform recurrence of morphic sequences is decidable. For this we show that the number of derived sequences of uniformly recurrent morphic sequences is bounded. As a corollary we obtain that uniformly recurrent morphic…
We study serial coalgebras by means of their valued Gabriel quivers. In particular, Hom-computable and representation-directed coalgebras are characterized. The Auslander-Reiten quiver of a serial coalgebra is described. Finally, a version…
Our paper investigates the linear logic of knowledge and time LTK_r with reflexive intransitive time relation. The logic is defined semantically, -- as the set of formulas which are true at special frames with intransitive and reflexive…
We describe new, simple, recursive methods of construction for orientable sequences over an arbitrary finite alphabet, i.e. periodic sequences in which any sub-sequence of n consecutive elements occurs at most once in a period in either…
We formalize the univariate fragment of Ben-Or, Kozen, and Reif's (BKR) decision procedure for first-order real arithmetic in Isabelle/HOL. BKR's algorithm has good potential for parallelism and was designed to be used in practice. Its key…
This paper shows that sequential statistical analysis techniques can be generalised to the problem of selecting between alternative forecasting methods using scoring rules. A return to basic principles is necessary in order to show that…
We derive "numerical" criteria for the existence of embeddings of representations of finite dimensional algebras.
Using only basic topological properties of real algebraic sets and regular morphisms we show that any injective regular self-mapping of a real algebraic set is surjective. Then we show that injective morphisms between germs of real…
This paper explores in some detail a recent proposal (the Rieffel induction/refined algebraic quantization scheme) for the quantization of constrained gauge systems. Below, the focus is on systems with a single constraint and, in this…
In this paper, we obtain fundamental $\mathcal{L}_{p}$ bounds in sequential prediction and recursive algorithms via an entropic analysis. Both classes of problems are examined by investigating the underlying entropic relationships of the…
We show how to represent an interval of real numbers in an abstract numeration system built on a language that is not necessarily regular. As an application, we consider representations of real numbers using the Dyck language. We also show…
Recurrent Neural Networks can be trained to produce sequences of tokens given some input, as exemplified by recent results in machine translation and image captioning. The current approach to training them consists of maximizing the…
Approaches to signal representation and coding theory have traditionally focused on how to best represent signals using parsimonious representations that incur the lowest possible distortion. Classical examples include linear and non-linear…
Join-preserving maps on the discrete time scale $\omega^+$, referred to as time warps, have been proposed as graded modalities that can be used to quantify the growth of information in the course of program execution. The set of time warps…