Formalizing mathematical knowledge as a biform theory graph: a case study

DOI10.1007/978-3-319-62075-6_2zbMATH Open1367.68299arXiv1704.02253OpenAlexW2605703278WikidataQ60712705 ScholiaQ60712705MaRDI QIDQ2364688FDOQ2364688

William M. Farmer, Jacques Carette

Publication date: 21 July 2017

Abstract: A biform theory is a combination of an axiomatic theory and an algorithmic theory that supports the integration of reasoning and computation. These are ideal for formalizing algorithms that manipulate mathematical expressions. A theory graph is a network of theories connected by meaning-preserving theory morphisms that map the formulas of one theory to the formulas of another theory. Theory graphs are in turn well suited for formalizing mathematical knowledge at the most convenient level of abstraction using the most convenient vocabulary. We are interested in the problem of whether a body of mathematical knowledge can be effectively formalized as a theory graph of biform theories. As a test case, we look at the graph of theories encoding natural number arithmetic. We used two different formalisms to do this, which we describe and compare. The first is realized in ${mCTT}_{muqe}$, a version of Church's type theory with quotation and evaluation, and the second is realized in Agda, a dependently typed programming language.

Full work available at URL: https://arxiv.org/abs/1704.02253

Mathematics Subject Classification ID

Knowledge representation (68T30) Mechanization of proofs and logical operations (03B35) First-order arithmetic and fragments (03F30)

Cites Work

• Title not available (Why is that?)
• IMPS: An interactive mathematical proof system
• Dependently Typed Programming in Agda
• Theorem Proving in Higher Order Logics
• A scalable module system
• Homotopy Type Theory: Univalent Foundations of Mathematics
• Information Flow
• Mathematical knowledge management: transcending the one-brain-barrier with theory graphs
• Logical number theory I. An introduction
• Formalizing mathematical knowledge as a biform theory graph: a case study
• Theory morphisms in Church's type theory with quotation and evaluation
• Incorporating Quotation and Evaluation into Church’s Type Theory: Syntax and Semantics
• The Formalization of Syntax-Based Mathematical Algorithms Using Quotation and Evaluation
• Biform Theories in Chiron
• High-Level Theories

Cited In (4)

• Incorporating quotation and evaluation into Church's type theory
• Knowledge representation for mathematical discovery: Three experiments in graph theory
• Formal entity graphs as complex networks: assessing centrality metrics of the archive of formal proofs
• Formalizing mathematical knowledge as a biform theory graph: a case study

Uses Software

• AXIOM
• IMPS
• Agda
• PoplMark

This page was built for publication: Formalizing mathematical knowledge as a biform theory graph: a case study

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2364688)