DeepAI AI Chat
Log In Sign Up

Verifier Theory and Unverifiability

by   Roman V. Yampolskiy, et al.

Despite significant developments in Proof Theory, surprisingly little attention has been devoted to the concept of proof verifier. In particular, the mathematical community may be interested in studying different types of proof verifiers (people, programs, oracles, communities, superintelligences) as mathematical objects. Such an effort could reveal their properties, their powers and limitations (particularly in human mathematicians), minimum and maximum complexity, as well as self-verification and self-reference issues. We propose an initial classification system for verifiers and provide some rudimentary analysis of solved and open problems in this important domain. Our main contribution is a formal introduction of the notion of unverifiability, for which the paper could serve as a general citation in domains of theorem proving, as well as software and AI verification.


page 1

page 2

page 3

page 4


Comparison of Two Theorem Provers: Isabelle/HOL and Coq

The need for formal definition of the very basis of mathematics arose in...

Mathematical Proof Between Generations

A proof is one of the most important concepts of mathematics. However, t...

Proof in the time of machines

We compare the values associated with (traditional) community based proo...

Introduction to local certification

Local certification is an concept that has been defined and studied rece...

A Formal Proof of the Irrationality of ζ(3)

This paper presents a complete formal verification of a proof that the e...

Independence of the Continuum Hypothesis: an Intuitive Introduction

The independence of the continuum hypothesis is a result of broad impact...

A formal proof of Hensel's lemma over the p-adic integers

The field of p-adic numbers Q_p and the ring of p-adic integers Z_p are ...