English
Related papers

Related papers: A preliminary univalent formalization of the p-adi…

200 papers

A complete list of one dimensional groups definable in the p-adic numbers is given, up to a finite index subroup and a quotient by a finite subgroup.

Logic · Mathematics 2023-06-22 Juan Pablo Acosta López

A numerical monoid is a cofinite additive submonoid of the nonnegative integers, while a Puiseux monoid is an additive submonoid of the nonnegative cone of the rational numbers. Using that a Puiseux monoid is an increasing union of copies…

Commutative Algebra · Mathematics 2021-12-03 Harold Polo

In order to help students learn how to write mathematical proofs, we adapt the Coq proof assistant into an educational tool we call Waterproof. Like with other interactive theorem provers, students write out their proofs inside the software…

We present an ongoing effort to implement Universal Algebra in the UniMath system. Our aim is to develop a general framework for formalizing and studying Universal Algebra in a proof assistant. By constituting a formal system for isolating…

Logic in Computer Science · Computer Science 2024-12-11 Gianluca Amato , Marco Maggesi , Maurizio Parton , Cosimo Perini Brogi

In this note we give a theoretical support by means of quotient polynomial rings for the computation formulas of the dimension of abelian codes.

Information Theory · Computer Science 2025-09-23 J. J. Bernal , J. J. Simón

This survey describes work on the number of variables required to ensure that a system of r quadratic forms over the p-adics has a non-trivial common zero.

Number Theory · Mathematics 2019-02-20 D. R. Heath-Brown

PyLog is a minimal experimental proof assistant based on linearised natural deduction for intuitionistic and classical first-order logic extended with a comprehension operator. PyLog is interesting as a tool to be used in conjunction with…

Logic · Mathematics 2023-06-06 Clarence Lewis Protin

Formal proof checkers such as Coq are capable of validating proofs of correction of algorithms for finite field arithmetics but they require extensive training from potential users. The delayed solution of a triangular system over a finite…

Symbolic Computation · Computer Science 2008-07-09 Sylvie Boldo , Marc Daumas , Pascal Giorgi

Reliable verification of proofs remains a bottleneck for training and evaluating AI systems on hard mathematical reasoning. Fully formal proofs, in languages like Lean, are easy to verify because they are unambiguous and modular. Most…

Logic in Computer Science · Computer Science 2026-05-21 Slim Barkallah , Luke Bailey , Kaiyue Wen , Mohammed Abouzaid , Tengyu Ma

Work in progress concerning alternative formalizations of arithmetic.

Logic · Mathematics 2018-01-04 David M. Cerna

The $p$-adic completion $\mathbb{Q}_p$ of the rational numbers induces a different absolute value $|\cdot|_p$ than the typical $| \cdot |$ we have on the real numbers. In this paper we compare and contrast functions $f \colon \mathbb{R}^{+}…

Metric Geometry · Mathematics 2019-12-24 Robert W. Vallin , Oleksiy A. Dovgoshey

Equational Unification is a critical problem in many areas such as automated theorem proving and security protocol analysis. In this paper, we focus on XOR-Unification, that is, unification modulo the theory of exclusive-or. This theory…

Logic in Computer Science · Computer Science 2025-02-14 Yichi Xu , Daniel J. Dougherty , Rose Bohrer

We describe the basic notions of co-induction as they are available in the coq system. As an application, we describe arithmetic properties for simple representations of real numbers.

Logic in Computer Science · Computer Science 2007-05-23 Yves Bertot

We comment on two formal proofs of Fermat's sum of two squares theorem, written using the Mathematical Components libraries of the Coq proof assistant. The first one follows Zagier's celebrated one-sentence proof; the second follows David…

Logic in Computer Science · Computer Science 2021-04-27 Guillaume Dubach , Fabian Muehlboeck

In this paper, we establish a q-analog of partial fraction decomposition formula. By using formula, we develop new closed form representations of sums of q-harmonic numbers and reciprocal q-binomial coefficients. Moreover, we give explicit…

Number Theory · Mathematics 2017-10-24 Ce Xu

Static analyzers based on abstract interpretation are complex pieces of software implementing delicate algorithms. Even if static analysis techniques are well understood, their implementation on real languages is still error-prone. This…

Programming Languages · Computer Science 2013-05-02 Sandrine Blazy , Vincent Laporte , André Maroneze , David Pichardie

Let p > 2 be a prime. Let Q(zeta) be the p-cyclotomic field. Let pi be the prime ideal of Q(zeta) lying over p. This article aims to describe some pi-adic congruences characterizing the structure of the p-class group and of the unit group…

Number Theory · Mathematics 2007-05-23 Roland Queme

In the context of interactive theorem provers based on a dependent type theory, automation tactics (dedicated decision procedures, call of automated solvers, ...) are often limited to goals which are exactly in some expected logical…

Logic in Computer Science · Computer Science 2024-02-22 Valentin Blot , Denis Cousineau , Enzo Crance , Louise Dubois de Prisque , Chantal Keller , Assia Mahboubi , Pierre Vial

We shall make a slight improvement to a result of p-adic logarithms which gives a nontrivial upper bound for the exponent of p dividing the Fermat quotient x^{p-1}-1.

Number Theory · Mathematics 2015-11-10 Tomohiro Yamada

In this paper, we will study p-adic q-expansion of alternating sums of powers. From these properties, we derive some interesting properties related to p-adic q-expansion of alternating sums of powers

Number Theory · Mathematics 2007-05-23 Taekyun Kim