Related papers: A preliminary univalent formalization of the p-adi…
Continued fractions have been long studied due to their strong properties, such as rational approximation. In this extent, their arithmetic over real numbers has represented an intriguing problem throughout the years. In this paper, we…
While teaching untyped $\lambda$-calculus to undergraduate students, we were wondering why $\alpha$-equivalence is not directly inductively defined. In this paper, we demonstrate that this is indeed feasible. Specifically, we provide a…
Cauchy reals can be defined as a quotient of Cauchy sequences of rationals. The limit of a Cauchy sequence of Cauchy reals is defined through lifting it to a sequence of Cauchy sequences of rationals. This lifting requires the axiom of…
In this paper we introduce an axiomatization of B\"uchi arithmetic, i.e., of the elementary theory of natural numbers in the language with addition and function $V_p(a) = p^k$ such that $p^k | a$ and $p^{k + 1} \nmid a$.
We propose a novel method for reconstructing Laurent expansion of rational functions using $p$-adic numbers. By evaluating the rational functions in $p$-adic fields rather than finite fields, it is possible to probe the expansion…
We associate a formal power series with integer coefficients to a positive real number, we interpret this series as a "$q$-analogue of a real." The construction is based on the notion of $q$-deformed rational number introduced in…
Real numbers in constructive mathematics have always seemed to require compromises of one form or another. Classical proofs of Cauchy completeness require countable choice, Bishop's setoid construction introduces persistent bookkeeping…
Common programming tools, like compilers, debuggers, and IDEs, crucially rely on the ability to analyse program code to reason about its behaviour and properties. There has been a great deal of work on verifying compilers and static…
We report on an original formalization of measure and integration theory in the Coq proof assistant. We build the Lebesgue measure following a standard construction that had not yet been formalized in proof assistants based on dependent…
Artificial intelligence assisted mathematical proof has become a highly focused area nowadays. One key problem in this field is to generate formal mathematical proofs from natural language proofs. Due to historical reasons, the formal proof…
An efficient intuitionistic first-order prover integrated into Coq is useful to replay proofs found by external automated theorem provers. We propose a two-phase approach: An intuitionistic prover generates a certificate based on the matrix…
An informal discussion of how the construction problem in algebraic geometry motivates the search for formal proof methods. Also includes a brief discussion of my own progress up to now, which concerns the formalization of category theory…
We present several steps towards large formal mathematical wikis. The Coq proof assistant together with the CoRN repository are added to the pool of systems handled by the general wiki system described in \cite{DBLP:conf/aisc/UrbanARG10}. A…
The purpose of this paper is to present a systemic study of some families of q-Euler numbers and polynomials of Norlund's type by using multivariate fermionic p-adic integral on Zp. Moreover, the study of these higher-order q-Euler numbers…
Understanding and predicting the properties of solid-state materials from first-principles has been a great challenge for decades. Owing to the recent advances in quantum technologies, quantum computations offer a promising way to achieve…
Let $G$ be a finite $p$-group. We construct a $G$-extension $K/k$ of number fields such that the $p$-adic completion of the unit group of $K$ has a prescribed $\mathbb{Z}_p[G]$-module structure, up to free direct summands.
A first-order conditional logic is considered, with semantics given by a variant of epsilon-semantics, where p -> q means that Pr(q | p) approaches 1 super-polynomially --faster than any inverse polynomial. This type of convergence is…
The aim of this paper is to propose an ``elementary" approach to Coleman's theory of p-adic abelian integrals. Our main tool is a theory of commutative p-adic Lie groups (the logarithm map); we use neither dagger analysis nor…
Creating safe concurrent algorithms is challenging and error-prone. For this reason, a formal verification framework is necessary especially when those concurrent algorithms are used in safety-critical systems. The goal of this guide is to…
We introduce operations with p-adic integer coefficients, associated to idempotents in the quantum cohomology of a monotone symplectic manifold, and apply them to the structure of the quantum connection.