New Opportunities for the Formal Proof of Computational Real Geometry? release_gmyqt67c2ncypffethxo4ahvga

by Erika Ábrahám, James Davenport, Matthew England, Gereon Kremer, Zak Tonks

Released as a article .

2020  

Abstract

The purpose of this paper is to explore the question "to what extent could we produce formal, machine-verifiable, proofs in real algebraic geometry?" The question has been asked before but as yet the leading algorithms for answering such questions have not been formalised. We present a thesis that a new algorithm for ascertaining satisfiability of formulae over the reals via Cylindrical Algebraic Coverings [Ábrahám, Davenport, England, Kremer, Deciding the Consistency of Non-Linear Real Arithmetic Constraints with a Conflict Driver Search Using Cylindrical Algebraic Coverings, 2020] might provide trace and outputs that allow the results to be more susceptible to machine verification than those of competing algorithms.
In text/plain format

Archived Files and Locations

application/pdf  405.2 kB
file_7sq5f3nxezcshgvy5pz2qlsla4
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2020-04-08
Version   v1
Language   en ?
arXiv  2004.04034v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 806f512e-e737-4712-b5b2-a0654d7d613d
API URL: JSON