A univalent formalization of the p-adic numbers

13Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

The goal of this paper is to report on a formalization of the p-adic numbers in the setting of the second author's univalent foundations program. This formalization, which has been verified in the Coq proof assistant, provides an approach to the p-adic numbers in constructive algebra and analysis.

References Powered by Scopus

Editorial: Convexity and Commuting Hamiltonians

536Citations
N/AReaders
Get full text

Convexity properties of the moment mapping

487Citations
N/AReaders
Get full text

p-adic numbers in physics

184Citations
N/AReaders
Get full text

Cited by Powered by Scopus

An experimental library of formalized Mathematics based on the univalent foundations

51Citations
N/AReaders
Get full text

Formalising perfectoid spaces

35Citations
N/AReaders
Get full text

Homotopy type theory and voevodsky's univalent foundations

16Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Pelayo, Á., Voevodsky, V., & Warren, M. A. (2015). A univalent formalization of the p-adic numbers. Mathematical Structures in Computer Science, 25(5), 1147–1171. https://doi.org/10.1017/S0960129514000541

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 2

50%

Professor / Associate Prof. 1

25%

Researcher 1

25%

Readers' Discipline

Tooltip

Computer Science 2

40%

Mathematics 2

40%

Agricultural and Biological Sciences 1

20%

Save time finding and organizing research with Mendeley

Sign up for free