Related papers: Arithmetic as a theory modulo
Martin-L\"of's Intuitionistic Theory of Types is becoming popular for formal reasoning about computer programs. To handle recursion schemes other than primitive recursion, a theory of well-founded relations is presented. Using primitive…
We begin by defining Temperley-Lieb algebra, in two different ways: as a presented algebra or as a diagrammatic algebra. Next, we look for a basis algorithmically, using rewriting theory. Finally, we introduce a generalization of the…
We discuss some applications of fusion rules and intertwining operators in the representation theory of cyclic orbifolds of the triplet vertex operator algebra. We prove that the classification of irreducible modules for the orbifold vertex…
We present a new fragment of axiomatic set theory for pure sets and for the iteration of power sets within given transitive sets. It turns out that this formal system admits an interesting hierarchy of models with true membership relation…
This paper surveys some applications of moduli theory to issues concerning the distribution of rational points on algebraic varieties. It will appear on the proceedings of the Fano Conference.
Formal logic has often been seen as uniquely placed to analyze mathematical argumentation. While formal logic is certainly necessary for a complete understanding of mathematical practice, it is not sufficient. Important aspects of…
This paper investigates some issues arising in categorical models of reversible logic and computation. Our claim is that the structural (coherence) isomorphisms of these categorical models, although generally overlooked, have decidedly…
In this paper, we apply results on number systems based on continued fraction expansions to modular arithmetic. We provide two new algorithms in order to compute modular multiplication and modular division. The presented algorithms are…
Combining a standard proof search method, such as resolution or tableaux, and rewriting is a powerful way to cut off search space in automated theorem proving, but proving the completeness of such combined methods may be challenging. It may…
Our main theorem classifies the Auslander-Reiten triangles according to properties of the morphisms involved. As a consequence, we are able to compute the mapping cone of an irreducible morphism. We finish by showing a technique for…
We present deductive systems for various modal logics that can be obtained from the constructive variant of the normal modal logic CK by adding combinations of the axioms d, t, b, 4, and 5. This includes the constructive variants of the…
We compute the noncommutative deformations of a family of modules over the first Weyl algebra. This example shows some important properties of noncommutative deformation theory that separates it from commutative deformation theory.
We explore the Collatz conjecture and its variants through the lens of termination of string rewriting. We construct a rewriting system that simulates the iterated application of the Collatz function on strings corresponding to mixed…
This paper introduces a space of variable lotteries and proves a constructive version of the expected utility theorem. The word ``constructive'' is used here in two senses. First, as in constructive mathematics, the logic underlying proofs…
This note describes a representation of the real numbers due to Schanuel. The representation lets us construct the real numbers from first principles. Like the well-known construction of the real numbers using Dedekind cuts, the idea is…
In a forthcoming book, professional computer scientist and physicist Paul Budnik presents an exposition of classical mathematical theory as the backdrop to an elegant thesis: we can interpret any model of a formal system of Peano Arithmetic…
The lambda Pi calculus can be extended with rewrite rules to embed any functional pure type system. In this paper, we show that the embedding is conservative by proving a relative form of normalization, thus justifying the use of the lambda…
We present a calculus providing a Curry-Howard correspondence to classical logic represented in the sequent calculus with explicit structural rules, namely weakening and contraction. These structural rules introduce explicit erasure and…
We introduce meta-factorization, a theory that describes matrix decompositions as solutions of linear matrix equations: the projector and the reconstruction equation. Meta-factorization reconstructs known factorizations, reveals their…
Turing's famous 'machine' framework provides an intuitively clear conception of 'computing with real numbers'. A recursive counterexample to a theorem shows that the theorem does not hold when restricted to computable objects. These…