A Formalization of Topological Spaces in Coq
نویسندگان
چکیده
Abstract It is a wish for Wu Wen-tsun to implement the mechanical proving of theorems in topology. Topological spaces constitute fundamental concept general topology, which significant understanding essential content Based on machine proof system axiomatic set theory, we presented computer formalization topological Coq. Basic examples are formalized, including indiscrete and discrete spaces. Furthermore, formal description some well-known equivalent definitions provided, based neighborhood closure presented. All code has been verified Coq, process standardized, rigorous reliable.
منابع مشابه
A formalization of Γ∞ in Coq
In this paper we present a formalization of the type systems Γ∞ in the proof assistant Coq. The family of type systems Γ∞, described in a recent article by Geuvers, McKinna and Wiedijk [9], presents type theory without the need for explicit contexts. A typing judgment in Γ∞ is of the shape A :∞ B while an ordinary judgment is of the shape Γ ` A : B. This approach of Geuvers et al. makes a bridg...
متن کاملModular Formalization of Reactive Modules in COQ
We present modular formalizations of the model specification language Reactive Modules and the temporal logic CTL∗ in the proof assistant Coq. In our formalizations, both shallow and deep embeddings of each language are given. The modularity of our formalizations allows proofs and theorems to be reused across different embeddings. We illustrate the advantages of our modular formalizations by pr...
متن کاملA Coq Formalization of Finitely Presented Modules
This paper presents a formalization of constructive module theory in the intuitionistic type theory of Coq. We build an abstraction layer on top of matrix encodings, in order to represent finitely presented modules, and obtain clean definitions with short proofs justifying that it forms an abelian category. The goal is to use it as a first step to get certified programs for computing topologica...
متن کاملFormalization of Wu's Simple Method in Coq
We present in this paper the integration within the Coq proof assistant, of a method for automatic theorem proving in geometry. We use an approach based on the validation of a certificate. The certificate is generated by an implementation in Ocaml of a simple version of Wu’s method.
متن کاملFormalization of Shannon's Theorems in SSReflect-Coq
The most fundamental results of information theory are Shannon’s theorems. These theorems express the bounds for reliable data compression and transmission over a noisy channel. Their proofs are non-trivial but rarely detailed, even in the introductory literature. This lack of formal foundations makes it all the more unfortunate that crucial results in computer security rely solely on informati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Electrical Engineering
سال: 2022
ISSN: ['1876-1100', '1876-1119']
DOI: https://doi.org/10.1007/978-981-19-2456-9_21