中文
相关论文

相关论文: A preliminary univalent formalization of the p-adi…

200 篇论文

Proof assistants are getting more widespread use in research and industry to provide certified and independently checkable guarantees about theories, designs, systems and implementations. However, proof assistant implementations themselves…

编程语言 · 计算机科学 2021-07-19 Matthieu Sozeau

This paper presents a Coq formalization of linear algebra over elementary divisor rings, that is, rings where every matrix is equivalent to a matrix in Smith normal form. The main results are the formalization that these rings support…

计算机科学中的逻辑 · 计算机科学 2019-03-14 Guillaume Cano , Cyril Cohen , Maxime Dénès , Anders Mörtberg , Vincent Siles

In [2], I constructed the p-adic q-integral on Zp. In this paper, we consider the properties of the p-adic invariant p-adic q-integral in the ring of p-adic integers at q=-1. Finally we give the some applications of p-adic q-integration at…

数论 · 数学 2007-05-23 Taekyun Kim

This notes explains how standard algorithms that construct sorting networks have been formalised and proved correct in the Coq proof assistant using the SSReflect extension.

数据结构与算法 · 计算机科学 2022-03-04 Laurent Théry

Proof assistants are software-based tools that are used in the mechanization of proof construction and validation in mathematics and computer science, and also in certified program development. Different tools are being increasingly used in…

形式语言与自动机理论 · 计算机科学 2015-05-04 Marcus Vinícius Midena Ramos , Ruy J. G. B. de Queiroz

In this paper we will investigate properties of modified q-Euler numbers and polynomials. The main purpose of this paper is to construct p-adic q-Euler measures.

数论 · 数学 2007-05-23 Hacer Ozden , Y. Simsek , I. N. Cangul , S. H. Rim

We present a first step towards the Coq implementation of the Theory of Tagged Objects formalism. The concept of tagged types is encoded, and the soundness proofs are discussed with some future work suggestions.

编程语言 · 计算机科学 2025-02-18 Matthew Gates , Alex Potanin

The purpose of this paper is to construct p-adic analytically continued function which interpolates q-Euler numbers at negative integer Finally, we give an explicit p-adic expansion as a power series in n.

数论 · 数学 2007-05-23 Taekyun Kim

Faces play a central role in the combinatorial and computational aspects of polyhedra. In this paper, we present the first formalization of faces of polyhedra in the proof assistant Coq. This builds on the formalization of a library…

计算机科学中的逻辑 · 计算机科学 2023-06-22 Xavier Allamigeon , Ricardo D. Katz , Pierre-Yves Strub

Matching logic is a formalism for specifying, and reasoning about, mathematical structures, using patterns and pattern matching. Growing in popularity, it has been used to define many logical systems such as separation logic with recursive…

计算机科学中的逻辑 · 计算机科学 2022-09-22 Péter Bereczky , Xiaohong Chen , Dániel Horpácsi , Lucas Peña , Jan Tušil

Due to their numerous advantages, formal proofs and proof assistants, such as Coq, are becoming increasingly popular. However, one disadvantage of using proof assistants is that the resulting proofs can sometimes be hard to read and…

编程语言 · 计算机科学 2017-12-12 Andrew Bedford

Let $p$ be a prime. We discuss $p$-adic properties of various arithmetical functions related to the coefficients of modular form and generating functions. Modular forms are considered as a tool of solving arithmetical problems. Examples of…

数论 · 数学 2007-09-12 Alexei Panchishkin

Sharing of notations and theories across an inheritance hierarchy of mathematical structures, e.g., groups and rings, is important for productivity when formalizing mathematics in proof assistants. The packed classes methodology is a…

编程语言 · 计算机科学 2020-09-22 Kazuhiko Sakaguchi

Floating point operations are fast, but require continuous effort on the part of the user in order to ensure that the results are correct. This burden can be shifted away from the user by providing a library of exact analysis in which the…

计算机科学中的逻辑 · 计算机科学 2011-12-20 Robbert Krebbers , Bas Spitters

In this work, we describe our experience in learning the use of a computer proof assistant - specifically, Lean - from scratch, through proving formulae for the solutions of polynomial equations. Specifically, in this work we characterize…

计算机科学中的逻辑 · 计算机科学 2022-01-04 Nicholas Dyson , Benedikt Ahrens , Jacopo Emmenegger

In the introduction of this paper we discuss a possible approach to the unitarizability problem for classical p-adic groups. In this paper we give some very limited support that such approach is not without chance. In a forthcoming paper we…

表示论 · 数学 2017-09-05 Marko Tadic

The substitution lemma is a renowned theorem within the realm of lambda-calculus theory and concerns the interactional behaviour of the metasubstitution operation. In this work, we augment the lambda-calculus's grammar with an uninterpreted…

计算机科学中的逻辑 · 计算机科学 2023-09-26 Maria J. D. Lima , Flávio L. C. de Moura

In a previous paper the second author developed a new approach to the abelian p-adic Stark Conjecture at s=1 and stated some related conjectures. This paper develops and applies techniques using p-adic measures and continued fractions to…

数论 · 数学 2007-05-23 Xavier-Francois Roblot , David Solomon

This is not a research paper, but a survey submitted to a proceedings volume.

代数几何 · 数学 2014-07-08 Ekaterina Amerik

By using p-adic q-integrals, we study the q-Bernoulli numbers and polynomials of higher order.

数论 · 数学 2015-06-26 Taekyun Kim