Related papers: On models of affine arithmetic

We prove that every finite direct product of crystallographic groups arising from an irreducible root system (in the sense of Lie theory) is profinitely rigid (equiv. first-order rigid). This is a generalization of recent proofs of…

The present paper shows meta-programming turn programming, which is rich enough to express arbitrary arithmetic computations. We demonstrate a type system that implements Peano arithmetics, slightly generalized to negative numbers. Certain…

We give a proof of Gabber's presentation lemma for finite fields. We use ideas from Poonen's proof of Bertini's theorem to prove this lemma in the special case of open subsets of the affine plane. We then reduce the case of general smooth…

The paper is a contribution both to the theoretical foundations and to the actual construction of efficient automatizable proof procedures for non-classical logics. We focus here on the case of finite-valued logics, and exhibit: (i) a…

We classify essential algebras whose irredundant non-refinable covers consist of primal algebras. The proof is obtained by constructing one to one correspondence between such algebras and partial orders on finite sets. Further, we prove…

In this paper we will give a scheme-theoretic discussion on the unramified extensions of an arithmetic function field in several variables. The notion of unramified discussed here is parallel to that in algebraic number theory and for the…

We investigate the arithmetic of algebraic curves on coarse moduli spaces for special linear rank two local systems on surfaces with fixed boundary traces. We prove a structure theorem for morphisms from the affine line into the moduli…

Cyclic proof systems for Heyting and Peano arithmetic eschew induction axioms by accepting proofs which are finite graphs rather than trees. Proving that such a cyclic proof system coincides with its more conventional variants is often…

Graded modal logics generalise standard modal logics via families of modalities indexed by an algebraic structure whose operations mediate between the different modalities. The graded "of-course" modality $!_r$ captures how many times a…

Cut-elimination is the bedrock of proof theory with a multitude of applications from computational interpretations to proof analysis. It is also the starting point for important meta-theoretical investigations including decidability,…

We introduce and begin to study Lie theoretical analogs of symplectic reflection algebras for a finite cyclic group, which we call "cyclic double affine Lie algebra". We focus on type A : in the finite (resp. affine, double affine) case, we…

We extend the work of A. Ciaffaglione and P. Di Gianantonio on mechanical verification of algorithms for exact computation on real numbers, using infinite streams of digits implemented as co-inductive types. Four aspects are studied: the…

We consider the fragment F of first order arithmetic in which quantification is restricted to ''for all but finitely many.'' We show that the integers form an F-elementary substructure of the real numbers. Consequently, the F-theory of…

In 2005, Abramsky introduced various linear/affine combinatory algebras of partial involutions over a suitable formal language, to discuss reversible computation in a game-theoretic setting. These algebras arise as instances of the general…

We consider codes defined over an affine algebra $\mathcal A=R[X_1,\dots,X_r]/\left\langle t_1(X_1),\dots,t_r(X_r)\right\rangle$, where $t_i(X_i)$ is a monic univariate polynomial over a finite commutative chain ring $R$. Namely, we study…

In this paper, we show that a partitioned formula \phi is dependent if and only if \phi has uniform definability of types over finite partial order indiscernibles. This generalizes our result from a previous paper [1]. We show this by…

Finite differences have been widely used in mathematical theory as well as in scientific and engineering computations. These concepts are constantly mentioned in calculus. Most frequently-used difference formulas provide excellent…

We define Jones's planar algebra as a map of multicategories and constuct a planar algebra starting from a 1-cell in a pivotal strict 2-category. We prove finiteness results for the affine representations of finite depth planar algebras. We…

We study canonical filtrations of finite-dimensional associative algebras and Lie algebras. These filtrations are defined via optimal destabilizing one-parameter subgroups in the sense of geometric invariant theory (GIT), and appear to be a…

We define instantiational and algorithmic completeness for a formal language. We show that, in the presence of Church's Thesis, an alternative interpretation of Goedelian incompleteness is that Peano Arithmetic is instantiationally…